A fast parallel algorithm for determining all roots of a polynomial with real roots

Parallel complexity of tridiagonal symmetric Eigenvalue problem

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Polynomial root-finding: analysis and computational investigation of a parallel algorithm

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Specified precision polynomial root isolation is in NC

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990

Lower bounds for parallel linear programming and other problems

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Is there an algebraic proof for P ≠ NC? (extended abstract)

STOC '97 Proceedings of the twenty-ninth 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

Computation of equilibriain noncooperative games

Computers & Mathematics with Applications

Computing bits of algebraic numbers

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Root finding with threshold circuits

Theoretical Computer Science