Computer algebra: symbolic and algebraic computation (2nd ed.)
Probabilistic computation of integer polynomial GCDs
Journal of Algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Subresultants and Reduced Polynomial Remainder Sequences
Journal of the ACM (JACM)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
A New Approach to Resultant Computations and Other Algorithms with Exact Division
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Theoretical Computer Science - Latin American theoretical informatics
An elementary approach to subresultants theory
Journal of Symbolic Computation
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
On the complexity of real solving bivariate systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Symmetric subresultants and applications
Journal of Symbolic Computation
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
On the asymptotic and practical complexity of solving bivariate systems over the reals
Journal of Symbolic Computation
Fast computation of special resultants
Journal of Symbolic Computation
Random polynomials and expected complexity of bisection methods for real solving
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
The DMM bound: multivariate (aggregate) separation bounds
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
A simple but exact and efficient algorithm for complex root isolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Homotopy techniques for multiplication modulo triangular sets
Journal of Symbolic Computation
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Journal of Symbolic Computation
A worst-case bound for topology computation of algebraic curves
Journal of Symbolic Computation
Genus 2 point counting over prime fields
Journal of Symbolic Computation
On the isotopic meshing of an algebraic implicit surface
Journal of Symbolic Computation
On the complexity of computing certain resultants
ACM Communications in Computer Algebra
On the complexity of solving a bivariate polynomial system
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Near optimal tree size bounds on a simple real root isolation algorithm
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Separating linear forms for bivariate systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On the complexity of solving bivariate systems: the case of non-singular solutions
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Fast algorithms for l-adic towers over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
| Hi-index | 0.00 |