On the complexity of algorithms for the translation of polynomials

The art of computer programming. Vol.1: Fundamental algorithms

Donald E. Knuth · Virtual Defense Library (Ministerio de Defensa) · 1978 · 804 citations

Engineering, Program Analysis, Algorithm Design +6

Evaluating Polynomials at Fixed Sets of Points

Alfred V. Aho, K. Steiglitz, Jeffrey D. Ullman · SIAM Journal on Computing · 1975 · 66 citations

Horner’s method of approximation anticipated by Ruffini

Florian Cajori · Bulletin of the American Mathematical Society · 1911 · 19 citations · Full text

Numerical Analysis, Pade Approximant, Engineering +5

On the forgotten theorem of Mr. Vincent

Alkiviadis G. Akritas, Stylianos D. Danielopoulos · Historia Mathematica · 1978 · 16 citations

Theoretical Mathematics, Literary History, Philosophical Inquiry +3

A new method for polynomial real root isolation

Alkiviadis G. Akritas · 1978 · 14 citations · Full text

Numerical Analysis, Pade Approximant, Square-free Polynomial P. +10