Manfred Göbel

24 papers B 2Journal 15Unranked 7
YearRankTypeTitle / Venue / Authors
2005 — conf
Continuous Visualization of SAGBI Bases for Parameterized Linear Subalgebras.
Algorithmic Algebra and Logic
Manfred Göbel
2002 J jnl
Finite SAGBI bases for polynomial invariants of conjugates of alternating groups.
Math. Comput.
Manfred Göbel
2002 J jnl
Reduction of Permutation-Invariant Polynomials - A Noncommutative Case Study.
Inf. Comput.
Manfred Göbel, Heinz Kredel
2001 J jnl
KLEIN: a MATHEMATICA Package for Radar Polarimetry Based on Spinor and Tensor Algebra.
J. Symb. Comput.
David Bebbington, Manfred Göbel
2001 J jnl
Visualizing Properties of Comprehensive SAGBI Bases - Two Examples.
Appl. Algebra Eng. Commun. Comput.
Manfred Göbel
2000 J jnl
Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order.
Inf. Process. Lett.
Manfred Göbel
1999 J jnl
A Rewriting Technique for Universal Polynomial Invariants.
Inf. Process. Lett.
Manfred Göbel
1999 J jnl
Bases for Polynomial Invariants of Conjugates of Permutation Groups.
J. Algorithms
Samir Khuller, Manfred Göbel, Jochen Walter
1999 B conf
Extending a Java Based Framework for Scientific Software-Components.
CASC
Manfred Göbel, Wolfgang Küchlin, Stefan Müller, Andreas Weber
1999 — conf
Fast Rewriting of Symmetric Polynomials.
RTA
Manfred Göbel
1999 J jnl
Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order.
Discret. Math. Theor. Comput. Sci.
Manfred Göbel
1999 J jnl
Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials.
Appl. Algebra Eng. Commun. Comput.
Manfred Göbel
1999 J jnl
The "Smallest" Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases w.r.t. Any Admissible Order.
Theor. Comput. Sci.
Manfred Göbel
1998 J jnl
A Constructive Description of SAGBI Bases for Polynomial Invariants of Permutation Groups.
J. Symb. Comput.
Manfred Göbel
1997 J jnl
On the Number of Special Permutation-Invariant Orbits and Terms.
Appl. Algebra Eng. Commun. Comput.
Manfred Göbel
1997 — conf
The Invariant Package of MAS.
RTA
Manfred Göbel
1996 — conf
A Master-Slave Approach to Parallel Term Rewriting on a Hierarchical Multiprocessor.
DISCO
Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
1996 J jnl
Strategy Compliant Multi-Threaded Term Completion.
J. Symb. Comput.
Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
1996 — conf
Symideal Gröbner Bases.
RTA
Manfred Göbel
1995 J jnl
Computing Bases for Rings of Permutation-Invariant Polynomials.
J. Symb. Comput.
Manfred Göbel
1995 — conf
Parallel ReDuX -> PaReDuX.
RTA
Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
1994 B conf
A Fine-Grained Parallel Completion Procedure.
ISSAC
Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
1994 — conf
Multi-Threaded AC Term Rewriting.
PASCO
Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
1993 J jnl
Using Buchbergers algorithm in invariant theory.
SIGSAM Bull.
Manfred Göbel