Author:
Amrhein Beatrice,Bündgen Reinhard,Küchlin Wolfgang
Reference84 articles.
1. J. Avenhaus and J. Denzinger. Distributing equational theorem proving. In Kirchner [Kir93], pages 62-76.
2. Beatrice Amrhein, Oliver Gloor, and Wolfgang Küchlin. A case study of multi-threaded Gröbner basis completion. In Lakshmann Y. N., editor, Proc. 1996 International Symposium on Symbolic and Algebraic Computation: ISSAC′96, pages 95–102, Zurich, Switzerland, July 24–26 1996. ACM Press.
3. Giuseppe Attardi and Carlo Traverso. A strategy-accurate parallel Buchberger algorithm. In Hong [Hon94], pages 12-21.
4. Leo Bachmair and Nachum Dershowitz. Inference rules for rewrite-based first-order theorem proving. In Logic in Computer Science, pages 331–337. IEEE Computer Society Press, 1987. Proc. LICS′87, Ithaca, New York, June 22–25, 1987.
5. Leo Bachmair and Nachum Dershowitz. Critical pair criteria for completion. J. Symbolic Computation, 6(1):1–18, August 1988.