Parallel complexity of tridiagonal symmetric Eigenvalue problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Asymptotic acceleration of solving multivariate polynomial systems of equations
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fast numerical improvement of factors of polynomials and of partial fractions
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
New techniques for approximating complex polynomial zeros
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Roots of a polynomial and its derivatives
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Electronic Notes in Theoretical Computer Science (ENTCS)
An Efficient Rescaled Perceptron Algorithm for Conic Systems
Mathematics of Operations Research
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Efficient polynomial root-refiners: A survey and new record efficiency estimates
Computers & Mathematics with Applications
A geometric algorithm for winding number computation with complexity analysis
Journal of Complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Root-refining for a polynomial equation
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
On the boolean complexity of real root refinement
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Finding the number of roots of a polynomial in a plane region using the winding number
Computers & Mathematics with Applications
| Hi-index | 0.02 |