A. V. Aho, K. Steiglitz, and J. D. Ullman, Evaluating Polynomials at Fixed Sets of Points, SIAM Journal on Computing, vol.4, issue.4, pp.533-539, 1975.
DOI : 10.1137/0204045

D. A. Bini and L. , Solving secular and polynomial equations: A multiprecision algorithm, Journal of Computational and Applied Mathematics, vol.272, 2013.
DOI : 10.1016/j.cam.2013.04.037

L. Bluestein, A linear filtering approach to the computation of discrete fourier transform. Audio and Electroacoustics, IEEE Transactions on, vol.18, issue.4, pp.451-455, 1970.

J. R. Bunch, Stability of Methods for Solving Toeplitz Systems of Equations, SIAM Journal on Scientific and Statistical Computing, vol.6, issue.2, pp.349-364, 1985.
DOI : 10.1137/0906025

J. Carrier, L. Greengard, and V. Rokhlin, A Fast Adaptive Multipole Algorithm for Particle Simulations, SIAM Journal on Scientific and Statistical Computing, vol.9, issue.4, pp.669-686, 1988.
DOI : 10.1137/0909044

I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas, The DMM bound, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.243-250, 2010.
DOI : 10.1145/1837934.1837981
URL : https://hal.archives-ouvertes.fr/inria-00393833

M. J. Fischer and M. S. Paterson, String-matching and other products, Complexity of Computation, vol.7, pp.113-125, 1974.

A. Gerasoulis, M. D. Grigoriadis, and L. Sun, A Fast Algorithm for Trummer???s Problem, SIAM Journal on Scientific and Statistical Computing, vol.8, issue.1, pp.135-138, 1987.
DOI : 10.1137/0908017

L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, Journal of Computational Physics, vol.73, issue.2, pp.325-348, 1987.
DOI : 10.1016/0021-9991(87)90140-9

P. Kirrinnis, Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z], Journal of Complexity, vol.14, issue.3, pp.378-444, 1998.
DOI : 10.1006/jcom.1998.0481

D. E. Knuth, The art of computer programming): seminumerical algorithms, 1997.

A. Kobel and M. Sagraloff, Fast approximate polynomial multipoint evaluation and applications. arXiv preprint, 2013.

M. Mignotte, Mathematics for Computer Algebra, 1991.
DOI : 10.1007/978-1-4613-9171-5

R. Moenck and A. Borodin, Fast modular transforms via division, 13th Annual Symposium on Switching and Automata Theory (swat 1972), pp.90-96, 1972.
DOI : 10.1109/SWAT.1972.5

V. Pan, Structured Matrices and Polynomials: Unified Superfast Algorithms, 2001.
DOI : 10.1007/978-1-4612-0129-8

V. Y. Pan and E. Tsigaridas, Nearly optimal refinement of real roots of a univariate polynomial, Journal of Symbolic Computation, vol.74, 2014.
DOI : 10.1016/j.jsc.2015.06.009
URL : https://hal.archives-ouvertes.fr/hal-00960896

F. P. Preparata and M. I. Shamos, Computational geometry. texts and monographs in computer science, 1985.

P. Ritzmann, A fast numerical algorithm for the composition of power series with complex coefficients, Theoretical Computer Science, vol.44, pp.1-16, 1986.
DOI : 10.1016/0304-3975(86)90107-6

J. Rokne and P. Lancaster, Complex interval arithmetic, Communications of the ACM, vol.14, issue.2, pp.111-112, 1971.
DOI : 10.1145/362515.362563

A. Schönhage, Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coeficients, LNCS, vol.144, pp.3-15, 1982.

A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Manuscript. Univ. of Tübingen, 1982.

A. Strzebo´nskistrzebo´nski and E. P. Tsigaridas, Univariate real root isolation in an extension field, Proc. 36th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), pp.321-328, 2011.

A. Strzebo´nskistrzebo´nski and E. P. Tsigaridas, Univariate real root isolation in presence of logarithms. Arxiv, 2014.

J. Van-der-hoeven, Fast composition of numeric power series, 2008.

C. Yap, Fundamental Problems of Algorithmic Algebra, 2000.