Solving some overdetermined polynomial systems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
A New Criterion for Normal Form Algorithms
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Functional programming concepts and straight-line programs in computer algebra
Mathematics and Computers in Simulation
Degree bounds and lifting techniques for triangular sets
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Complexity results for triangular sets
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Polynomial equation solving by lifting procedures for ramified fibers
Theoretical Computer Science - Algebraic and numerical algorithm
Deformation techniques to solve generalised Pham systems
Theoretical Computer Science - Algebraic and numerical algorithm
Lifting techniques for triangular decompositions
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
On the probability distribution of singular varieties of given corank
Journal of Symbolic Computation
Change of order for regular chains in positive dimension
Theoretical Computer Science
Computing the global optimum of a multivariate polynomial over the reals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
Evaluation techniques for zero-dimensional primary decomposition
Journal of Symbolic Computation
Evaluation properties of invariant polynomials
Journal of Symbolic Computation
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
| Hi-index | 0.01 |