Computational aspects of deciding if all roots of a polynomial lie within the unit circle

The art of computer programming. Vol.2: Seminumerical algorithms

Donald E. Knuth · Virtual Defense Library (Ministerio de Defensa) · 1981 · 1.2K citations

Computing, Computer Science, Mathematics +11

Subresultants and Reduced Polynomial Remainder Sequences

George E. Collins · Journal of the ACM · 1967 · 330 citations

Computing, Computer Science, Algebra +9

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

Warren S. Brown · Journal of the ACM · 1971 · 294 citations · Full text

Computing, Computer Science, Algorithms +8

The Art of Computer Programming. Vol. II: Seminumerical Algorithms

J. W. W., Donald E. Knuth · Mathematics of Computation · 1970 · 294 citations

Computing, Computer Science, Mathematics +11

On Euclid's Algorithm and the Theory of Subresultants

Warren S. Brown, J. F. Traub · Journal of the ACM · 1971 · 258 citations · Full text

Computing, Computer Science, Algorithms +4