Bibliography

AL94

William Adams and Philippe Loustaunau.
An introduction to Gröbner bases, volume 3 of Graduate studies in mathematics.
American Mathematical Society, Providence, R.I., 1994.

BS92

David Bayer and Michael Stillman.
Computation of Hilbert Functions.
J. Symbolic Comp., 14(1):31--50, 1992.

Buc65

Bruno Buchburger.
Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal.
PhD thesis, University of Innsbruck, Austria, 1965.

BW93

Thomas Becker and Volker Weispfenning.
Gröbner Bases.
Graduate Texts in Mathematics. Springer, New York--Berlin--Heidelberg, 1993.

CKM97

Stephane Collart, Michael Kalkbrener, and Daniel Mall.
Converting Bases with the Gröbner Walk.
J. Symbolic Comp., 24(3):465--469, 1997.

CLO96

David Cox, John Little, and Donal O'Shea.
Ideals, Varieties and Algorithms.
Undergraduate Texts in Mathematics. Springer, New York--Berlin--Heidelberg, 2nd edition, 1996.

Fau99

Jean-Charles Faug`ere.
A new efficient algorithm for computing Gröbner bases (F_4).
Journal of Pure and Applied Algebra, 139 (1-3):61--88, 1999.

FGLM93

Jean-Charles Faug`ere, Patrizia Gianni, Daniel Lazard, and Teo Mora.
Efficient computations of zero-dimensional Gröbner bases by change of ordering.
J. Symbolic Comp., 16:329--344, 1993.

Laz92

Daniel Lazard.
Solving Zero-dimensional Algebraic Systems.
J. Symbolic Comp., 13(2):117--131, 1992.

Möl88

H.M. Möller.
On the construction of Gröbner bases using syzygies.
J. Symbolic Comp., 6:345--359, 1988.

Tra96

Carlo Traverso.
Hilbert Functions and the Buchberger Algorithm.
J. Symbolic Comp., 22(4):355--376, 1996.