Computer Algebra: Past and Future
Journal of Symbolic Computation
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Critical pair criteria for completion
Journal of Symbolic Computation
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
Journal of Symbolic Computation
A generalization of reduction rings
Journal of Symbolic Computation
Lifting canonical algorithms from a ring R to the ring R[x]
Journal of Symbolic Computation
Journal of Symbolic Computation
On the construction of Gröbner bases using syzygies
Journal of Symbolic Computation
On the D-bases of polynomial ideals over principal ideal domainst
Journal of Symbolic Computation
Computer algebra on MIMD machine
ACM SIGSAM Bulletin
Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
Journal of Symbolic Computation
Completion of integral polynomials by AC-term completion
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem
Journal of Symbolic Computation
Geometry theorem proving in vector spaces by means of Gröbner bases
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
Gröbner bases in orders of algebraic number fields
Journal of Symbolic Computation
Gröbner bases with coefficients in rings
Journal of Symbolic Computation
Combining equational reasoning
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
| Hi-index | 0.01 |