Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
Numerische Mathematik
On the worst-case arithmetic complexity of approximating zeros of polynomials
Journal of Complexity
Parallel algorithmic techniques for combinatorial computation
Annual review of computer science: vol. 3, 1988
A fast parallel algorithm for determining all roots of a polynomial with real roots
SIAM Journal on Computing
Optimal size integer division circuits
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Parallel polynomial computations by recursive processes
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Parallel least-squares solution of general and Toeplitz systems
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On the Euclidean scheme for polynomials having interlaced real zeros
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Simple algorithms for approximating all roots of a polynomial with real roots
Journal of Complexity
The symmetric eigenvalue problem
The symmetric eigenvalue problem
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Survey of Parallel Algorithms for Shared-Memory Machines
A Survey of Parallel Algorithms for Shared-Memory Machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
On the boolean complexity of real root refinement
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |