Theoretical Computer Science - Latin American theoretical informatics
An elementary approach to subresultants theory
Journal of Symbolic Computation
Towards faster real algebraic numbers
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
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
Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
International Journal of Computer Mathematics
Real algebraic numbers and polynomial systems of small degree
Theoretical Computer Science
On the asymptotic and practical complexity of solving bivariate systems over the reals
Journal of Symbolic Computation
Automatic computation of the complete root classification for a parametric polynomial
Journal of Symbolic Computation
Faster real feasibility via circuit discriminants
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
A parametric representation of totally mixed Nash equilibria
Computers & Mathematics with Applications
Comparative methods for the polynomial isolation
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Birational properties of the gap subresultant varieties
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
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
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Journal of Symbolic Computation
Journal of Symbolic Computation
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
On exact rasterization of real algebraic plane curves
Proceedings of the 27th Spring Conference on Computer Graphics
Rational univariate representations of bivariate systems and applications
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
Hi-index | 0.00 |