Nearly optimal algorithms for canonical matrix forms

Fast algorithms for rational forms of integer matrices

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

Fast parallel computation of the Smith normal form of polynomial matrices

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

Fast computation of the Smith normal form of an integer matrix

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

Subquadratic-time factoring of polynomials over finite fields

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

An O(n3) algorithm for the Frobenius normal form

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation

Square-free decomposition in finite characteristic: an application to Jordon Form computation

ACM SIGSAM Bulletin

Computing rational forms of integer matrices

Journal of Symbolic Computation

On the complexity of polynomial matrix computations

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation

The shifted number system for fast linear algebra on integer matrices

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Faster algorithms for the characteristic polynomial

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

The shifted number system for fast linear algebra on integer matrices

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage