Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices

Parallelism and algorithms for algebraic manipulation: current work

ACM SIGSAM Bulletin

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

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

A new approach to parallel computation of polynomial GCD and to related parallel computations over fields and integer rings

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

Matching is as easy as matrix inversion

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Some polynomial and Toeplitz matrix computations

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Efficient parallel linear programming

Operations Research Letters