History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Standard bases and geometric invariant theoryI. Initial ideals and state polytopes
Journal of Symbolic Computation
Computing dimension and independent sets for polynomial ideals
Journal of Symbolic Computation
Combinatorial dimension theory of algebraicvarieties
Journal of Symbolic Computation
The design of LINETOOL, a geometric editor
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On the castelnuovo regularity for curves
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Geometric computations with algebraic varieties of bounded degree
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A new lower bound construction for commutative thue systems with applications
Journal of Symbolic Computation
On the Gröbner bases of some symmetric systems and their application to coding theory
Journal of Symbolic Computation
An algorithm for the computation of the radical of an ideal
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Complexity of the resolution of parametric systems of polynomial equations and inequations
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
The degree-complexity of the defining ideal of a smooth integral curve
Journal of Symbolic Computation
Incomplete Gröbner basis as a preconditioner for polynomial systems
Journal of Computational and Applied Mathematics
Degree bounds for Gröbner bases of low-dimensional polynomial ideals
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |