A solution to the extended GCD problem with applications

Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix

SIAM Journal on Computing

Fast parallel computation of hermite and smith forms of polynomial matrices

SIAM Journal on Algebraic and Discrete Methods

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity

Asymptotically fast triangularization of matrices over rings

SIAM Journal on Computing

Fast computation of the Smith normal form of an integer matrix

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

Preconditioning of rectangular polynomial matrices for efficient Hermite normal form computation

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

A solution to the extended gcd problem

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

Generalized subresultants for computing the Smith normal form of polynomial matrices

Journal of Symbolic Computation

Near optimal algorithms for computing Smith normal forms of integer matrices

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

A Hard Problem That is Almost Always Easy

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation

The complexity of greatest common divisor computations

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory

Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix

ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory