M. Ben-or and P. Tiwari, Simple algorithms for approximating all roots of a polynomial with real roots, Journal of Complexity, vol.6, issue.4, pp.417-442, 1990.
DOI : 10.1016/0885-064X(90)90032-9

D. A. Bini and G. Fiorentino, Design, analysis, and implementation of a multiprecision polynomial rootfinder, Numerical Algorithms, vol.23, issue.2/3, pp.127-173, 2000.
DOI : 10.1023/A:1019199917103

D. A. Bini and L. Robol, Solving secular and polynomial equations: A multiprecision algorithm, Journal of Computational and Applied Mathematics, vol.272, issue.59, pp.276-292, 1991.
DOI : 10.1016/j.cam.2013.04.037

Q. Du, M. Jin, T. Y. Li, and Z. Zeng, The quasi-Laguerre iteration, Mathematics of Computation, vol.66, issue.217, pp.66-345, 1997.
DOI : 10.1090/S0025-5718-97-00786-2

I. Z. Emiris, V. Y. Pan, and E. Tsigaridas, Algebraic algorithms. Chapter 10 of Computing Handbook Available at arXiv 1311, Computer Science and Software Engineering, vol.I, p.3731, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00776270

S. Fortune, An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials, Journal of Symbolic Computation, vol.33, issue.5, pp.627-646, 2002.
DOI : 10.1006/jsco.2002.0526

G. Malajovich and J. P. Zubelli, Tangent Graeffe iteration, Numerische Mathematik, vol.89, issue.4, pp.749-782, 2001.
DOI : 10.1007/s002110100278
URL : http://arxiv.org/abs/math/9908150

J. M. Mcnamee, Numerical Methods for Roots of Polynomials, 2007.

J. M. Mcnamee, V. Y. Pan, and V. Y. Pan, Numerical Methods for Roots of Polynomials Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros Approximating complex polynomial zeros: modified quadtree (Weyl's) construction and improved Newton's iteration, Proc. 27th AnnP00] PanP01] Pan, V.Y.: Structured Matrices and Polynomials: Unified Superfast Algorithms. Birkhäuser, pp.741-750, 1995.

V. Y. Pan, A new proximity test for polynomial zeros, Computers & Mathematics with Applications, vol.41, issue.12, pp.41-1559, 2001.
DOI : 10.1016/S0898-1221(01)00120-1

V. Y. Pan, Univariate polynomials, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.701-733, 2001.
DOI : 10.1145/384101.384136

V. Y. Pan and E. P. Tsigaridas, On the boolean complexity of real root refinement, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pp.299-306, 2013.
DOI : 10.1145/2465506.2465938
URL : https://hal.archives-ouvertes.fr/hal-00816214

V. Y. Pan and E. P. Tsigaridas, Nearly optimal computations with structured matrices, Proc. of the International Conference on Symbolic Numeric Computation (SNC'2014, p.14044768, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00980591

V. Y. Pt14b-]-pan and E. P. Tsigaridas, Accelerated approximation of the complex roots of a univariate polynomial, Proc. of the International Conference on Symbolic Numeric Computation (SNC'2014, p.14044775, 2014.

]. V. Pt14c, E. Pan, and . Tsigaridas, Nearly Optimal Refinement of Real Roots of a Univariate Polynomial

J. Renegar, On the worst-case arithmetic complexity of approximating zeros of polynomials, Journal of Complexity, vol.3, issue.2, pp.90-113, 1987.
DOI : 10.1016/0885-064X(87)90022-7

A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Math. Department, 1982.

M. Sagraloff, K. Mehlhorn, and P. Tilli, Computing real roots of real polynomials. CoRR, abstract 1308 Convergence conditions of some methods for the simultaneous computations of polynomial zeros. Calcolo, pp.3-15, 1998.
URL : https://hal.archives-ouvertes.fr/hal-01363955

A. Van-der-sluis, Upperbounds for roots of polynomials, Numerische Mathematik, vol.15, issue.3, pp.250-262, 1970.
DOI : 10.1007/BF02168974