Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
On the worst-case arithmetic complexity of approximating zeros of polynomials
Journal of Complexity
A fast parallel algorithm for determining all roots of a polynomial with real roots
SIAM Journal on Computing
Simple algorithms for approximating all roots of a polynomial with real roots
Journal of Complexity
Parallel complexity of tridiagonal symmetric Eigenvalue problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
New resultant inequalities and complex polynomial factorization
ISTCS'92 Symposium proceedings on Theory of computing and systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Electronic Notes in Theoretical Computer Science (ENTCS)
A simple but exact and efficient algorithm for complex root isolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |