1. R. Loos, “Term reduction systems and algebraic algorithms,” in: Proc. 5 th German Workshop on Artificial Intelligence, Informatik Fachberichte, Vol. 47, Springer (1981), pp. 214–234.
2. B. Buchberger and R. Loos, “Algebraic simplification,” Computing Supplement, 4, 11–43 (1982).
3. B. Buchberger, “Basic features and development of the critical pair completion procedure,” in: Rewriting Techniques and Applications, Lectures Notes in Computer Science, Vol. 02, Springer (1986), pp. 1–45.
4. B. Buchberger, “History and basic features of the critical pair completion procedure,” J. Symbolic Computation, 3, 3–38 (1987).
5. B. Reinert, On Groebner Bases in Monoid and Group Rings, PhD Thesis, Universitaet Kaiserslautern (1995).