1. Amrhein, B., R. Bündgen, and W. Küchlin: 1998, ‘Parallel Completion Techniques’. In: M. Bronstein, J. Grabmeier, and V. Weispfenning (eds.): Proc. 1995 Workshop on Symbolic Rewriting Techniques. Monte Verità, Ascona, Switzerland. In print.
2. Anantharaman, D. and N. Andrianarievelo: 1990, ‘Heuristical criteria in refutational theorem proving’. In: A. Miola (ed.): Design and Implementation of Symbolic Computation Systems (DISCO ‘90), Vol. 429 of Lecture Notes in Computer Science. Capri, Italy, pp. 184 – 193.
3. Attardi, G. and C. Traverso: 1994, ‘A Strategy-Accurate parallel Buchberger algorithm’. In: H. Hong (ed.): First International Symposium on Parallel Symbolic Computation PASCO’94. pp. 12–21. (Proc. PASCO’94, Linz, Austria, September 1994 ).
4. Avenhaus, J. and J. Denzinger: 1993, ‘Distributing Equational Theorem Proving’. In: C. Kirchner (ed.): Rewriting Techniques and Applications (LNCS 690). pp. 62–76. (Proc. RTA’93, Montreal, Canada, June 1993 ).
5. Bachmair, L., N. Dershowitz, and D. A. Plaisted: 1989, ‘Completion Without Failure’. In: H. Aït-Kaci and M. Nivat (eds.): Rewriting Techniques, Vol. 2 of Resolution of Equations in Algebraic Structures. Academic Press, Chapt. 1.