Publisher
Springer Berlin Heidelberg
Reference247 articles.
1. Aho, A., Sethi, R., and Ullman, J.D., 1972: Code Optimization and finite Church-Rosser theorems. In: Design and Optimisation of Compilers (ed. by R. Rustin), Prentice Hall, 89–105.
2. Armbruster, D., 1985: Bifurcation theory and computer algebra: an initial approach. Proc. EUROCAL 85, LNCS, Springer,to appear.
3. Bachmair, L., and Buchberger, B., 1980: A simplified proof of the characterization theorem for Gröbner bases. ACM SIGSAM Bull 14/4, 29–34.
4. Bachmair, L., and Plaisted, D.A., 1985: Termination orderings for associative commutative rewriting systems. J. of Symbolic Computation (Academic Press), to appear.
5. Ballantyne, A.M., and Lankford, D.S., 1981: New decision algorithms for finitely presented commutative semigroups. Computers and Maths. with Appls. 7, 159–165; preliminary version: Rep. MTP-4, Louisiana Tech Univ., Dep. of Math. 1979.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献