The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Manfred Göbel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
    A Master-Slave Approach to Parallel Term Rewriting on a Hierarchical Multiprocessor. [Citation Graph (0, 0)][DBLP]
    DISCO, 1996, pp:183-194 [Conf]
  2. Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
    A Fine-Grained Parallel Completion Procedure. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1994, pp:269-277 [Conf]
  3. Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
    Parallel ReDuX -> PaReDuX. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:408-413 [Conf]
  4. Manfred Göbel
    The Invariant Package of MAS. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:327-330 [Conf]
  5. Manfred Göbel
    Fast Rewriting of Symmetric Polynomials. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:371-381 [Conf]
  6. Manfred Göbel
    Symideal Gröbner Bases. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:48-62 [Conf]
  7. Manfred Göbel
    Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1999, v:9, n:6, pp:559-573 [Journal]
  8. Manfred Göbel
    On the Number of Special Permutation-Invariant Orbits and Terms. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:6, pp:505-509 [Journal]
  9. Manfred Göbel
    Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1999, v:3, n:2, pp:65-70 [Journal]
  10. Manfred Göbel, Heinz Kredel
    Reduction of Permutation-Invariant Polynomials - A Noncommutative Case Study. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:175, n:2, pp:158-170 [Journal]
  11. Manfred Göbel
    Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:15-18 [Journal]
  12. Manfred Göbel
    A Rewriting Technique for Universal Polynomial Invariants. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:6, pp:271-273 [Journal]
  13. Samir Khuller, Manfred Göbel, Jochen Walter
    Bases for Polynomial Invariants of Conjugates of Permutation Groups. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:1, pp:58-61 [Journal]
  14. David Bebbington, Manfred Göbel
    KLEIN: a MATHEMATICA Package for Radar Polarimetry Based on Spinor and Tensor Algebra. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:31, n:6, pp:745-751 [Journal]
  15. Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
    Strategy Compliant Multi-Threaded Term Completion. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1996, v:21, n:4, pp:475-505 [Journal]
  16. Manfred Göbel
    Computing Bases for Rings of Permutation-Invariant Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:19, n:4, pp:285-291 [Journal]
  17. Manfred Göbel
    A Constructive Description of SAGBI Bases for Polynomial Invariants of Permutation Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:26, n:3, pp:261-272 [Journal]
  18. Manfred Göbel
    Finite SAGBI bases for polynomial invariants of conjugates of alternating groups. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2002, v:71, n:238, pp:761-765 [Journal]
  19. Manfred Göbel
    The "Smallest" Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases w.r.t. Any Admissible Order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:225, n:1-2, pp:177-184 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002