Efficient parallel solution of linear systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Complexity of parallel matrix computations
Theoretical Computer Science
Superfast solution of real positive definite toeplitz systems
SIAM Journal on Matrix Analysis and Applications
Divide-and-conquer solutions of least-squares problems for matrices with displacement structure
SIAM Journal on Matrix Analysis and Applications
Simple algorithms for approximating all roots of a polynomial with real roots
Journal of Complexity
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
An introduction to parallel algorithms
An introduction to parallel algorithms
Parallel and output sensitive algorithms for combinatorial and linear algebra problems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
O(log2 n) time efficient parallel factorization of dense, sparse separable, and banded matrices
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On Wiedemann's Method of Solving Sparse Linear Systems
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Approximate algorithms to derive exact solutions to systems of linear equations
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Proceedings of the seventh 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
| Hi-index | 0.00 |