Journal of the ACM Bibliography

Additional Key Words and Phrases: algebra, asymptotic bounds, Chinese remainder algorithm, coefficient growth, computing time analysis, Euclid's algorithm, greatest common divisors, intermediate expression swell, modular arithmetic, modular mappings, polynomial remainder sequences, polynomials, subresultants

Selected papers that cite this one

• W. S. Brown and J. F. Traub. On Euclid's algorithm and the theory of subresultants. Journal of the ACM, 18(4):505-514, October 1971.

• George E. Collins. The calculation of multivariate polynomial resultants. Journal of the ACM, 18(4):515-532, October 1971.

• Michael T. McClellan. The exact solution of systems of linear equations with polynomial coefficients. Journal of the ACM, 20(4):563-588, October 1973.

• Victor Y. Pan. Parallel computation of polynomial GCD and some related parallel computations over abstract fields. Theoretical Computer Science, 162(2):173-223, 20 August 1996.

Selected references

• W. S. Brown and J. F. Traub. On Euclid's algorithm and the theory of subresultants. Journal of the ACM, 18(4):505-514, October 1971.

• George E. Collins. Subresultants and reduced polynomial remainder sequences. Journal of the ACM, 14(1):128-142, January 1967.

• George E. Collins. The calculation of multivariate polynomial resultants. Journal of the ACM, 18(4):515-532, October 1971.

Shortcuts: