The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A generalized Graeffe's iteration for evaluating polynomials and rational functions
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
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
Computer algebra handbook
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)
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
New progress in real and complex polynomial root-finding
Computers & Mathematics with Applications
Root-finding by expansion with independent constraints
Computers & Mathematics with Applications
Efficient polynomial root-refiners: A survey and new record efficiency estimates
Computers & Mathematics with Applications
Univariate polynomial root-finding by arming with constraints
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Root-refining for a polynomial equation
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.01 |