Products of polynomials and a priori estimates for coefficients in polynomial decompositions: a sharp result

Practical factorization of univariate polynomials over finite fields

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

Height as a coefficient bound for univariate polynomial factors, part II

ACM SIGSAM Bulletin

Classical deterministic complexity of Edmonds' Problem and quantum entanglement

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Classical complexity and quantum entanglement

Journal of Computer and System Sciences - Special issue: STOC 2003

Factoring polynomials over global fields I

Journal of Symbolic Computation

Bounds on factors in Z[x]

Journal of Symbolic Computation