11819 Joachim Apel: Effective Gröbner structures.
Internet ca. 1998, 13p.

Olaf Bachmann/Hans Schönemann: Monomial operations for computations
of Gröbner bases. Internet 1998, 7p.

18786 Ulla Koppenhagen/Ernst Mayr: An optimal algorithm for constructing
the reduced Gröbner basis of binomial ideals. J. Symb. Comp. 28 (1999), 317-338.

18788 Ulla Koppenhagen/Ernst Mayr: An optimal algorithm for constructing
the reduced Gröbner basis of binomial ideals, and applications to
commutative semigroups. J. Symb. Comp. 31 (2001), 259-276.

18789 Klaus Kühnle/Ernst Mayr: Exponential space computation of Gröbner
bases. TU München TUM-I9606 (1996), 14p.

18787 Ernst Mayr: Some complexity results for polynomial ideals.
J. Complexity 13 (1997), 303-325.

18831 T. Dube'/Bud Mishra/Chee-keng Yap: Complexity of Buchberger's
algorithm for Gröbner bases. Internet 1995, 17p.

18832 T. Dube'/Bud Mishra/Chee-keng Yap: Admissible orderings and bounds
for Gröbner basis normal form algorithms. Internet 1995, 28p.

U. Meinhold: Algorithmische Aspekte zur Theorie der Gröbnerbasen.
Wiss. Zeit. 32 (1988), 213-214.