---
title: "Bibliography"
canonical: "https://docs.magma-maths.org/CommutativeAlgebra/GrobnerBases/bibliography.html"
source: "https://docs.magma-maths.org/CommutativeAlgebra/GrobnerBases/bibliography.md"
part: "Commutative Algebra"
chapter: "Gröbner Bases"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Commutative Algebra", "source": "../index-commutative-algebra.md"}
  - {"title": "Gröbner Bases", "source": "index-grobner-bases.md"}
prev: {"title": "SAT solver", "source": "sat.md"}
next: {"title": "Polynomial Ring Ideal Operations", "source": "../PolynomialRingIdealOperations/index-polynomial-ring-ideal-operations.md"}
---

# Bibliography

<a id="cite-adamsloustaunau"></a>
- **[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.
<a id="cite-beckerweispfenning"></a>
- **[BW93]** Thomas Becker and Volker Weispfenning. *Gröbner Bases*. Graduate Texts in Mathematics. Springer, New York–Berlin–Heidelberg, 1993.
<a id="cite-buchberger"></a>
- **[Buc65]** Bruno Buchburger. *Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal*. PhD thesis, University of Innsbruck, Austria, 1965.
<a id="cite-gwalk"></a>
- **[CKM97]** Stephane Collart, Michael Kalkbrener, and Daniel Mall. Converting Bases with the Gröbner Walk. *J. Symbolic Comp.*, 24(3):465–469, 1997.
<a id="cite-clo"></a>
- **[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.
<a id="cite-uag-clo"></a>
- **[CLO98]** David Cox, John Little, and Donal O'Shea. *Using Algebraic Geometry*. Graduate Texts in Mathematics. Springer, New York–Berlin–Heidelberg, 1998.
<a id="cite-faugeref4"></a>
- **[Fau99]** Jean-Charles Faugère. A new efficient algorithm for computing Gröbner bases ($F_4$). *Journal of Pure and Applied Algebra*, 139 (1-3):61–88, 1999.
<a id="cite-fglm"></a>
- **[FGLM93]** Jean-Charles Faugère, 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.
<a id="cite-moellercriteria"></a>
- **[Mol88]** H.M. Möller. On the construction of Gröbner bases using syzygies. *J. Symbolic Comp.*, 6:345–359, 1988.
<a id="cite-steelgbtimings"></a>
- **[Ste04]** Allan Steel. Gröbner Basis Timings Page. http://magma.maths.usyd.edu.au/users/allan/gb/, 2004.
<a id="cite-hilbertbuchberger"></a>
- **[Tra96]** Carlo Traverso. Hilbert Functions and the Buchberger Algorithm. *J. Symbolic Comp.*, 22(4):355–376, 1996.