Factoring modular polynomials (extended abstract)

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

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity

Algorithms in number theory

Handbook of theoretical computer science (vol. A)

On the generation of multivariate polynomials which are hard to factor

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms

Subquadratic-time factoring of polynomials over finite fields

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

The Calculation of Multivariate Polynomial Resultants

Journal of the ACM (JACM)

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms