17310 William Adams/Philippe Loustaunau: An introduction to Gröbner bases. AMS 1994, 280p. $39. 10458 Klaus Aigner: Maple V procedure for computation of Gro''bner bases by the Gro''bner walk. Internet 1997, 33p. 11680 Beatrice Amrhein/Oliver Gloor: The fractal walk. In 11648 Buchberger/Winkler, 305-322. 2974 M. Atkinson/A. Negro/N. Santoro: Sums of lexicographically ordered sets. Discrete Math. 80 (1990), 115-122. 4665 Elisa Baldissara: Un programma in Pascal per le basi di Groebner. Tesi, Ferrara 1989. 5737 Thomas Becker/Volker Weispfenning: Gro''bner bases. Springer 1993. 2953 N. Bose (ed.): Multidimensional systems theory. Reidel 1985. Bruno Buchberger: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Dissertation, Innsbruck 1965. Bruno Buchberger: Ein algorithmisches Kriterim fuer die Lo''sbarkeit eines algebraischen Gleichungssystems. Aequationes Math. 4 (1970), 374-393. 11697 Bruno Buchberger: An algorithmic criterion for the solvability of a system of algebraic equations. In 11648 Buchberger/Winkler, 535-545. [Translation of the article in Aequationes Math. 4 (1970), 374-393.] 2954 Bruno Buchberger: Gröbner bases - an algorithmic method in polynomial ideal theory. In Bose 1985, 184-232. 11666 Bruno Buchberger: Introduction to Gröbner bases. In 11648 Buchberger/Winkler, 3-31. 18704 Bruno Buchberger: Gröbner bases and systems theory. Multidim. Systems Signal Proc. 12 (2001), 223-251. 10380 Bruno Buchberger/Juan Elias: Using Gro''bner bases for detecting polynomial identities - a case study of Fermat's ideal. J. Number Theory 41 (1992), 272-279. 11648 Bruno Buchberger/Franz Winkler (ed.): Gro''bner bases and applications. Cambridge UP 1998, 540p. 0-521-63298-6 (pb). 7199 L. Cerlienco/M. Mureddu/F. Piras: Combinatorial-algebraic techniques in Groebner bases theory. Internet 1995. 7260 Chiara Chendi: L'algoritmo di Buchberger. Tesi, Ferrara 1995. 4628 David Cox/John Little/Donal O'Shea: Ideals, varieties, and algorithms. Springer 1992. 18321 David Cox/John Little/Donal O'Shea: Using algebraic geometry. Springer 2005, 570p. L. Dickson: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35 (1913), 413-422. 11998 David Eisenbud: Commutative algebra. With a view towards algebraic geometry. Springer 1995, 800p. 3-540-94269-6 (pb). DM 59. 18790 David Eisenbud/Bernd Sturmfels: Binomial ideals. Duke Math. J. 84 (1996), 1-45. 18696 Krister Forsman: The hitch hiker's guide to Gröbner bases - commutative algebra for amateurs. Internet 1992, 8p. 18697 Krister Forsman: Elementary aspects of constructive commutative algebra. Internet 1992, 75p. 18699 Krister Forsman: Localization and base change techniques in computational algebra. Internet 1993, 10p. R. Fröberg: An introduction to Gröbner bases. Wiley 1998, 180p. Pds. 33. 20364 Komei Fukuda/Anders Jensen/Rekha Thomas: Computing Gröbner fans. Internet 2007, 26p. 16837 Shu-huong Gao/Virginia Rodrigues/Jeffrey Stroomer: Gröbner basis structure of finite sets of points. Internet 2003, 16p. 16059 Joachim von zur Gathen/Ju''rgen Gerhard: Modern computer algebra. Cambridge UP 2003, 780p. Eur 58. 3316 R. Gebauer/H. Mo''ller: A new implementation of Buchberger's algorithm. Preprint. Keith Geddes/Stephen Czapor/George Labahn: Algorithms for computer algebra. Kluwer 1992, 590p. Eur 111. 2991 Patrizia Gianni/B. Trager/G. Zacharias: Groebner bases and primary decomposition of polynomial ideals. Manuscript. 11647 Amos Golinelli: Qualche applicazione della teoria delle basi di Gro''bner. Tesi, Ferrara 1987. 25978 Hans-Gert Gräbe: Gröbnerbasen und Anwendungen. Vorl. Univ. Leipzig SS 2011, 74p. 23148 Willem de Graaf: Computational algebra. Internet ca. 2011, 70p. 11669 Mark Green/Michael Stillman: A tutorial on generic initial ideals. In 11648 Buchberger/Winkler, 90-108. 16045 Gert-Martin Greuel/Gerhard Pfister: A SINGULAR introduction to commutative algebra. Springer 2002, 590p. Eur 43. 23281 Andre' Heck: Bird's-eye view of Gröbner bases. Nuclear Instr. Meth. Physics Res. A 389 (1997), 16-21. 15966 Gabor Hegedüs/Lajos Ronyai: Gröbner bases for complete uniform families. Internet 2003, 13p. 22149 Theo de Jong: Computing Gröbner bases and syzygies using second syzygies. Internet 2000, 12p. 18826 Muhammed al-Kahoui/Said Rakrak: Structure of Gröbner bases with respect to block orders. Math. Comp. ... (2007), 7p. Aleksei Kondratiev: Numerical computation of Gröbner bases. Dissertation RISC Linz 2004, 360p. Available as ftp.risc.uni-linz.ac.at/pub/techreports/2004/04-03.ps.gz. 16944 Martin Kreuzer/Lorenzo Robbiano: Computational commutative algebra 1. Springer 2000, 320p. Eur 43. 19922 Martin Kreuzer/Lorenzo Robbiano: Computational commutative algebra 2. Springer 2005, 580p. Eur 52. 10552 Joseph Kruskal: The theory of well-quasi-ordering - a frequently rediscovered concept. J. Comb. Theory A 13 (1972), 297-305. Rudolf Lidl/Gu''nter Pilz: Applied abstract algebra. Springer ca. 1996. Contains a very short introduction to Gro''bner bases. 11686 Henri Lombardi/Herve' Perdry: The Buchberger algorithm as a tool for ideal theory of polynomial rings in constructive mathematics. In 11648 Buchberger/Winkler, 393-407. 18785 Ernst Mayr: On polynomial ideals, their complexity, and applications. TU München TUM-I9520 (1995), 16p. 19923 Ezra Miller/Bernd Sturmfels: Combinatorial commutative algebra. Springer 2005, 420p. Eur 40. 11688 J. Lyn Miller: Effective algorithms for intrinsically computing SAGBI-Gro''bner bases in a polynomial ring over a field. In 11648 Buchberger/Winkler, 421-433. Bud Mishra: Algorithmic algebra. Springer 1993, 430p. 3-540-94090-1. $40. 18830 Bud Mishra/Chee-keng Yap: Notes on Gröbner bases. Information Sciences 48 (1989), 219-252. 3315 H. Möller: [Brief 11.4.1989]. H. Möller/F. Mora: New constructive methods in classical ideal theory. J. Algebra 100 (1986), 138-178. 11689 Ferdinando Mora: De nugis Groebnerialium 1 - Eagon, Northcott, Gro''bner. In 11648 Buchberger/Winkler, 434-447. 18341 Teo Mora: Solving polynomial equation systems. 2 volumes. Cambridge UP 2003+2005, 420+760p. Eur 102+130. A masterpiece. Teo Mora/Harold Mattson (ed.?): Applied algebra, algebraic algorithms and error-correcting codes. Springer 1997. Thomas Nuessler/Hans Schoenemann: Gro''bner bases in algebras with zero-divisors. Univ. Kaiserslautern Preprint ... (1993), 21p. 2796 Franz Pauer: Gröbnerbasen und ihre Anwendungen. 2790 Chatterji/, 127-149. 19591 Franz Pauer: Gröbnerbasen. Vorlesung Univ. Innsbruck 2004, 49p. 2933 Franz Pauer/M. Pfeifhofer: The theory of Gro''bner bases. L'Ens. Math. 34 (1988), 215-232. 1533 Francesca Ranzi: Metodi effettivi di computer algebra in geometria algebrica. Tesi, Ferrara 1990 (?). L. Redei: The theory of finitely generated commutative semigroups. Pergamon Press 1965. 11822 Birgit Reinert: Gro''bnerbasen. Vorlesung (Kaiserslautern) Wintersemester 1996/97, 79p. 1277 Lorenzo Robbiano (ed.): Computational aspects of commutative algebra. Academic Press 1989. 2988 Lorenzo Robbiano: Computer and commutative algebra. Dip. Mat. Genova 59 (1988). 2989 Lorenzo Robbiano: Introduction to the theory of Gro''bner bases. Dip. Mat. Genova 60 (1988). Lorenzo Robbiano: Introduzione all'algebra computazionale. Corso INDAM 1986/87. 16654 Marko Roczen: First steps with Gröbner bases. Internet 1998, 16p. 16653 Marko Roczen: Gröbner bases and resultants. Internet 1999, 5p. When Gröbner bases fail, resultants may help. 10456 Giovanna Roda: Linear algebra methods for the transformation of Gro''bner bases. RISC Rep. 95-54 (1995), 16p. 2514 P. Senechaud: A MIND implementation of the Buchberger algorithm for Boolean polynomials. Parallel computing 17 (1991), 29-37. 11695 Jan Snellman: Reverse lexicographic initial ideals of generic ideals are finitely generated. In 11648 Buchberger/Winkler, 504-518. 18343 Hans Stetter: Numerical polynomial algebra. SIAM 2004, 470p. Eur 84. 16021 Bernd Sturmfels: Gröbner bases and convex polytopes. AMS 1996, 160p. $30. 16020 Bernd Sturmfels: Solving systems of polynomial equations. AMS 2002, 150 Eur. $32. 17324 Bernd Sturmfels: What is a Gröbner basis? Notices AMS November 2005, ... 1380 G. Trevisan: Classificazione dei semplici ordinamenti di un gruppo libero commutativo con n generatori. Rend. Sem. Mat. Padova 22 (1953), 143-156. W. Trinks: Ueber B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu loesen. J. Number theory 10 (1978), 475-488. W. Vasconcelos: Computational methods in commutative algebra and algebraic geometry. Springer 1997, 380p. 3-540-60520-7. DM 118. D. Wang: Elimination methods. Springer 2000, 270p. DM 108. 12092 Franz Winkler: Polynomial algorithms in computer algebra. Springer 1996, 250p. 3-211-82759-5. DM 89. 3098 M. Wymann-Boeni: Kanonische Codierungen von N^k. Elemente der Math. 46 (1991), 130-139. 3318 ZZ: The concept of Gro''bner bases. Manuscript.