Using Buchbergers algorithm in invariant theory. - Manfred Göbel (SIGSAM Bull., 1993)

A Fine-Grained Parallel Completion Procedure. - Reinhard Bündgen; Manfred Göbel; Wolfgang Küchlin (ISSAC, 1994)

Multi-Threaded AC Term Rewriting. - Reinhard Bündgen; Manfred Göbel; Wolfgang Küchlin (PASCO, 1994)

Parallel ReDuX -> PaReDuX. - Reinhard Bündgen; Manfred Göbel; Wolfgang Küchlin (RTA, 1995)

Computing Bases for Rings of Permutation-Invariant Polynomials. - Manfred Göbel (J. Symb. Comput., 1995)

A Master-Slave Approach to Parallel Term Rewriting on a Hierarchical Multiprocessor. - Reinhard Bündgen; Manfred Göbel; Wolfgang Küchlin (DISCO, 1996)

Symideal Gröbner Bases. - Manfred Göbel (RTA, 1996)

Strategy Compliant Multi-Threaded Term Completion. - Reinhard Bündgen; Manfred Göbel; Wolfgang Küchlin (J. Symb. Comput., 1996)

The Invariant Package of MAS. - Manfred Göbel (RTA, 1997)

On the Number of Special Permutation-Invariant Orbits and Terms. - Manfred Göbel (Appl. Algebra Eng. Commun. Comput., 1997)

A Constructive Description of SAGBI Bases for Polynomial Invariants of Permutation Groups. - Manfred Göbel (J. Symb. Comput., 1998)

Extending a Java Based Framework for Scientific Software-Components. - Manfred Göbel; Wolfgang Küchlin; Stefan Müller 010; Andreas Weber 004 (CASC, 1999)

Fast Rewriting of Symmetric Polynomials. - Manfred Göbel (RTA, 1999)

Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials. - Manfred Göbel (Appl. Algebra Eng. Commun. Comput., 1999)

Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order. - Manfred Göbel (Discret. Math. Theor. Comput. Sci., 1999)

A Rewriting Technique for Universal Polynomial Invariants. - Manfred Göbel (Inf. Process. Lett., 1999)

Bases for Polynomial Invariants of Conjugates of Permutation Groups. - Samir Khuller; Manfred Göbel; Jochen Walter (J. Algorithms, 1999)

The "Smallest" Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases w.r.t. Any Admissible Order. - Manfred Göbel (Theor. Comput. Sci., 1999)

Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order. - Manfred Göbel (Inf. Process. Lett., 2000)

Visualizing Properties of Comprehensive SAGBI Bases - Two Examples. - Manfred Göbel (Appl. Algebra Eng. Commun. Comput., 2001)

KLEIN: a MATHEMATICA Package for Radar Polarimetry Based on Spinor and Tensor Algebra. - David Bebbington; Manfred Göbel (J. Symb. Comput., 2001)

Reduction of Permutation-Invariant Polynomials - A Noncommutative Case Study. - Manfred Göbel; Heinz Kredel (Inf. Comput., 2002)

Finite SAGBI bases for polynomial invariants of conjugates of alternating groups. - Manfred Göbel (Math. Comput., 2002)

Continuous Visualization of SAGBI Bases for Parameterized Linear Subalgebras. - Manfred Göbel (Algorithmic Algebra and Logic, 2005)