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

A. Kobel and M. Sagraloff, Fast Approximate Polynomial Multipoint Evaluation and Applications, 2013.

J. M. Mcnamee and V. Y. Pan, Numerical Methods for Roots of Polynomials, 2013.

K. Mehlhorn, M. Sagraloff, and P. Wang, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Proc. Intl. Symp. on Symbolic and Algebraic Computations (ISSAC), pp.283-290, 2013.
DOI : 10.1016/j.jsc.2014.02.001

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

V. Y. Pan, Transformations of Matrix Structures Work Again, accepted by Linear Algebra and Its Applications, available at arXiv:1311, 2013.

V. Y. Pan, Fast Approximation Algorithms for Computations with Cauchy Matrices and Extensions, p.2014

V. Y. Pan and E. P. Tsigaridas, Nearly optimal refinement of real roots of a univariate polynomial, Journal of Symbolic Computation, vol.74
DOI : 10.1016/j.jsc.2015.06.009

URL : https://hal.archives-ouvertes.fr/hal-00960896

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

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

A. Schönhage, The Fundamental Theorem of Algebra in Terms of Computational Complexity, manuscript, 1982.