J. Abbott, Quadratic interval refinement for real roots, ACM Communications in Computer Algebra, vol.48, issue.1/2, 2006.
DOI : 10.1145/2644288.2644291
URL : http://arxiv.org/abs/1203.1227

S. Basu, R. Pollack, and M. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol.10, 2006.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

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. Bini and G. Fiorentino, Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numerical Algorithms, pp.127-173, 2000.

D. Bini and V. Y. Pan, Parallel complexity of tridiagonal symmetric eigenvalue problem, Proc. 2nd Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), pp.384-393, 1991.

D. Bini and V. Y. Pan, Eine praktische Verbesserung der Divide- und Conquer-Algorithmen, Computing, vol.3, issue.2, pp.109-123, 1992.
DOI : 10.1007/BF02241709

D. Bini and V. Y. Pan, Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real, SIAM Journal on Computing, vol.27, issue.4, pp.1099-1115, 1998.
DOI : 10.1137/S0097539790182482

L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, 1998.
DOI : 10.1007/978-1-4612-0701-6

M. Bodrato and A. Zanoni, Long Integers and Polynomial Evaluation with Estrin's Scheme, 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.39-46, 2011.
DOI : 10.1109/SYNASC.2011.17

J. Cheng, S. Lazard, L. M. Peñaranda, M. Pouget, F. Rouillier et al., On the topology of planar algebraic curves, Proceedings of the 25th annual symposium on Computational geometry, SCG '09, pp.361-370, 2009.
DOI : 10.1145/1542362.1542424
URL : https://hal.archives-ouvertes.fr/inria-00329754

G. E. Collins and W. Krandick, A hybrid method for high precision calculation of polynomial real roots, Proceedings of the 1993 international symposium on Symbolic and algebraic computation , ISSAC '93, pp.47-52, 1993.
DOI : 10.1145/164081.164090

J. H. Davenport, Cylindrical algebraic decomposition, School of Mathematical Sciences, 1988.

D. I. Diochnos, I. Z. Emiris, and E. P. Tsigaridas, On the asymptotic and practical complexity of solving bivariate systems over the reals, Journal of Symbolic Computation, vol.44, issue.7, pp.818-835, 2009.
DOI : 10.1016/j.jsc.2008.04.009

Z. Du, V. Sharma, and C. K. Yap, Amortized Bound for Root Isolation via Sturm Sequences, Int. Workshop on Symbolic Numeric Computing, pp.113-129, 2005.
DOI : 10.1007/978-3-7643-7984-1_8

A. Eigenwillig, Real root isolation for exact and approximate polynomials using Descartes' rule of signs, 2008.

P. Emeliyanenko and M. Sagraloff, On the complexity of solving a bivariate polynomial system, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.154-161, 2012.
DOI : 10.1145/2442829.2442854

I. Z. Emiris, A. Galligo, and E. P. Tsigaridas, Random polynomials and expected complexity of bisection methods for real solving, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.235-242, 2010.
DOI : 10.1145/1837934.1837980
URL : https://hal.archives-ouvertes.fr/inria-00482722

W. Hart and A. Novocin, Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic, Proc. CASC, pp.200-214, 2011.
DOI : 10.1007/978-3-642-23568-9_16
URL : https://hal.archives-ouvertes.fr/hal-00650389

J. R. Johnson, Algorithms for Polynomial Real Root Isolation, 1991.
DOI : 10.1007/978-3-7091-9459-1_13

M. Kerber, On the Complexity of Reliable Root Approximation, Proc. 11th Int'l Wkshp on Computer Algebra in Scientific Computing (CASC), pp.155-167, 2009.
DOI : 10.1016/j.tcs.2008.09.017

M. Kerber and M. Sagraloff, Efficient real root approximation, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.209-216, 2011.
DOI : 10.1145/1993886.1993920
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.475

M. Kerber and M. Sagraloff, A worst-case bound for topology computation of algebraic curves, Journal of Symbolic Computation, vol.47, issue.3, pp.239-258, 2012.
DOI : 10.1016/j.jsc.2011.11.001

A. Mantzaflaris, B. Mourrain, and E. P. Tsigaridas, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, Theoretical Computer Science, vol.412, issue.22, pp.2312-2330, 2011.
DOI : 10.1016/j.tcs.2011.01.009
URL : https://hal.archives-ouvertes.fr/inria-00530756

J. M. Mcnamee and V. Y. Pan, Numerical methods for roots of polynomials (II), chapter 15, 2013.

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

V. Pan, Optimal and nearly optimal algorithms for approximating polynomial zeros, Computers & Mathematics with Applications, vol.31, issue.12, pp.97-138, 1996.
DOI : 10.1016/0898-1221(96)00080-6

V. Pan, Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration, Journal of Complexity, vol.16, issue.1, pp.213-264, 2000.
DOI : 10.1006/jcom.1999.0532
URL : http://doi.org/10.1006/jcom.1999.0532

V. 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. Pan and E. Linzer, Bisection acceleration for the symmetric tridiagonal eigenvalue problem, Numerical Algorithms, vol.22, issue.1, pp.13-39, 1999.
DOI : 10.1023/A:1019146505291

V. Y. Pan, Transformations of matrix structures work again, Linear Algebra and its Applications, vol.465
DOI : 10.1016/j.laa.2014.09.004

V. Y. Pan, B. Murphy, R. E. Rosholt, G. Qian, and Y. Tang, Real root-finding, Proc. 2nd ACM Int'l Work. Symbolic Numeric Computation (SNC), pp.161-169, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01105309

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

F. Rouillier, On Solving Systems of Bivariate Polynomials, pp.100-104, 2010.
DOI : 10.1007/978-3-642-15582-6_21
URL : https://hal.archives-ouvertes.fr/hal-01110516

M. Sagraloff, When Newton meets Descartes, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.297-304, 1982.
DOI : 10.1145/2442829.2442872

V. Sharma, Z. Du, and C. Yap, Robust Approximate Zeros, Proc. European Symposium of Algorithms (ESA), pp.874-886, 2005.
DOI : 10.1007/11561071_77

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.

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065

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