Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs

Introduction to algorithms

Introduction to algorithms

Parallel complexity of tridiagonal symmetric Eigenvalue problem

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

Complexity of computations with matrices and polynomials

SIAM Review

Approximate GCD and its application to ill-conditioned algebraic equations

ISCM '90 Proceedings of the International Symposium on Computation mathematics

Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms

The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation

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

Work efficient parallel solution of Toeplitz systems and polynomial GCD

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

Parallel computation of polynomial GCD and some related parallel computations over abstract fields

Theoretical Computer Science

Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation

Approximate complex polynomial evaluation in near constant work per point

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

The structure of sparse resultant matrices

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation

Detection and validation of clusters of polynomial zeros

Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra

Solving a Polynomial Equation: Some History and Recent Progress

SIAM Review

The symmetric eigenvalue problem

The symmetric eigenvalue problem

Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

Efficient parallel solution of sparse eigenvalue and eigenvector problems

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Explaining and ameliorating the ill condition of zeros of polynomials.

Explaining and ameliorating the ill condition of zeros of polynomials.