1. Bruno Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nultdimensionalen Polynomideal. PhD thesis, Universität Innsbruck, 1965.
2. Bruno Buchberger. Gröbner bases: an algorithmic method in polynomial ideal theory. In N. K. Böse, editor, Recent Trends in Multidimensional Systems Theory, chapter 6, Reidel, 1985. (Also Report CAMP-83.29, U. Linz, 1983).
3. Reinhard Bündgen. Completion of integral polynomials by AC-term completion. In Stephen M. Watt, editor, International Symposium on Symbolic and Algebraic Computation, pages 70–78, 1991. (Proc. ISSAC'91, Bonn, Germany, July 1991).
4. Reinhard Bündgen. Simulating Buchberger's algorithm by Knuth-Bendix completion. In Ronald V. Book, editor, Rewriting Techniques and Applications (LNCS 488), Springer-Verlag, 1991. (Proc. RTA'91, Como, Italy, April 1991).
5. Reinhard Bündgen. Term Completion Versus Algebraic Completion. PhD thesis, Universität Tübingen, D-7400 Tübingen, Germany, May 1991. (reprinted as report WSI 91-3).