1. Boyer, Bob, ?Rewrite rule compilation?, Technical Report AI-194-86-P, Micro-electronics and Computer Technology Corporation (MCC) (June 1986).
2. Christian, Jim, ?High-performance permutative completion?, Ph.D. thesis, University of Texas at Austin (1989). Available as MCC Technical Report ACT-AI-303-89.
3. Christian, Jim, ?Fast Knuth-Bendix completion: Summary?, inProceedings of the Conference on Rewriting Techniques and Applications, Chapel Hill, North Carolina (1989).
4. Knuth, Donald, and Bendix, Peter, ?Simple word problems in universal algebra?, in J. Leech (ed.),Computational Problems in Abstract Algebra, Pergamon Press, Oxford, U.K. (1970).
5. Geser, Alfons, Hussman, Heinrich, and Mück, Andreas, ?A compiler for a class of conditional term rewriting systems?, inProceedings of the 1st Intl. Workshop on Conditional Term Rewriting Systems, pp. 84?90, Orsay, France (1987).