On the genericity of the modular polynomial GCD algorithm

Greatest common divisors of polynomials given by straight-line programs

Journal of the ACM (JACM)

Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

Journal of Symbolic Computation - Special issue on computational algebraic complexity

Algorithms for computer algebra

Algorithms for computer algebra

On computing greatest common divisors with polynomials given by black boxes for their evaluations

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

Computing GCDs of polynomials over algebraic number fields

Journal of Symbolic Computation

FOXBOX: a system for manipulating symbolic objects in black box representation

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

Computing univariate GCDs over number fields

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

On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)

Efficient Multivariate Factorization over Finite Fields

AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

In-place Arithmetic for Polinominals over Zn

DISCO '92 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems

Sparse Hensel Lifting

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2

Algorithms for Gaussian integer arithmetic

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

A modular greatest common divisor algorithm for gaussian polynomials

ACM '75 Proceedings of the 1975 annual conference

Algorithms for polynomial factorization.

Algorithms for polynomial factorization.