A. Alesina and M. Galuzzi, A new proof of Vincent's theorem. L'Enseignement Mathémathique, pp.219-256, 1998.

M. Barto? and B. Jüttler, Computing roots of polynomials by quadratic clipping, Computer Aided Geometric Design, vol.24, issue.3, pp.125-141, 2007.
DOI : 10.1016/j.cagd.2007.01.003

L. Blum, F. Cucker, M. Shub, and S. Smale, COMPLEXITY AND REAL COMPUTATION: A MANIFESTO, International Journal of Bifurcation and Chaos, vol.06, issue.01, pp.3-26, 1996.
DOI : 10.1142/S0218127496001818

E. Bombieri and A. Van-der-poorten, Continued Fractions of Algebraic Numbers, Computational algebra and number theory, pp.137-152, 1992.
DOI : 10.1007/978-94-017-1108-1_10

G. Chèze, J. Yakoubsohn, A. Galligo, and B. Mourrain, Computing nearest Gcd with certification, Proceedings of the 2009 conference on Symbolic numeric computation, SNC '09, pp.29-34
DOI : 10.1145/1577190.1577200

F. Cucker, T. Krick, G. Malajovich, and M. Wschebor, A numerical algorithm for zero counting, I: Complexity and accuracy, Journal of Complexity, vol.24, issue.5-6, pp.5-6582, 2008.
DOI : 10.1016/j.jco.2008.03.001

F. Cucker, T. Krick, G. Malajovich, and M. Wschebor, A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis, Journal of Fixed Point Theory and Applications, vol.6, issue.2, pp.10-1007, 2009.
DOI : 10.1007/s11784-009-0127-4

J. P. Dedieu and J. C. Yakoubsohn, Computing the real roots of a polynomial by the exclusion algorithm, Numerical Algorithms, vol.20, issue.1, pp.1-24, 1993.
DOI : 10.1007/BF02142738

A. Eigenwillig, V. Sharma, and C. K. Yap, Almost tight recursion tree bounds for the Descartes method, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.71-78, 2006.
DOI : 10.1145/1145768.1145786

G. Elber and M. Kim, Geometric constraint solver using multivariate rational spline functions, Proceedings of the sixth ACM symposium on Solid modeling and applications , SMA '01, pp.1-10, 2001.
DOI : 10.1145/376957.376958

I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas, Real Algebraic Numbers: Complexity Analysis and Experimentation, Reliable Implementations of Real Number Algorithms: Theory and Practice, pp.57-82, 2008.
DOI : 10.1007/978-3-540-85521-7_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.9180

Z. Ioannis, B. Emiris, E. P. Mourrain, and . Tsigaridas, The DMM bound: Multivariate (aggregate ) separation bounds, Proc. 35th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), pp.243-250, 2010.

J. Garloff and A. P. Smith, Investigation of a subdivision based algorithm for solving systems of polynomial equations, Nonlinear Analysis: Theory, Methods & Applications, vol.47, issue.1, pp.167-178, 2001.
DOI : 10.1016/S0362-546X(01)00166-3

M. Hemmer, E. P. Tsigaridas, Z. Zafeirakopoulos, I. Z. Emiris, M. I. Karavelas et al., Experimental evaluation and cross-benchmarking of univariate real solvers, Proceedings of the 2009 conference on Symbolic numeric computation, SNC '09, pp.45-54, 2009.
DOI : 10.1145/1577190.1577202
URL : https://hal.archives-ouvertes.fr/inria-00340887

P. Lévy, Sur les lois de probabilitié dont dependent les quotients complets et incomplets d' une fraction continue, Bull. Soc. Math, vol.57, pp.178-194, 1929.

A. Mantzaflaris, B. Mourrain, and E. Tsigaridas, Continued fraction expansion of real roots of polynomial systems, Proceedings of the 2009 conference on Symbolic numeric computation, SNC '09, pp.85-94, 2009.
DOI : 10.1145/1577190.1577207
URL : https://hal.archives-ouvertes.fr/inria-00387399

M. Marden, Geometry of Polynomials, 1966.
DOI : 10.1090/surv/003

K. Mehlhorn and S. Ray, Faster algorithms for computing Hong???s bound on absolute positiveness, Journal of Symbolic Computation, vol.45, issue.6, pp.677-683, 2010.
DOI : 10.1016/j.jsc.2010.02.002

B. Mourrain and J. P. Pavone, Subdivision methods for solving polynomial equations, Journal of Symbolic Computation, vol.44, issue.3, pp.292-306, 2009.
DOI : 10.1016/j.jsc.2008.04.016
URL : https://hal.archives-ouvertes.fr/inria-00070350

B. Mourrain, F. Rouillier, and M. Roy, Bernstein's basis and real root isolation, Mathematical Sciences Research Institute Publications, pp.459-478, 2005.

V. Y. Pan, Solving a Polynomial Equation: Some History and Recent Progress, SIAM Review, vol.39, issue.2, pp.187-220, 1997.
DOI : 10.1137/S0036144595288554

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. Sharma, Complexity of real root isolation using continued fractions, Theoretical Computer Science, vol.409, issue.2, pp.292-310, 2008.
DOI : 10.1016/j.tcs.2008.09.017
URL : https://hal.archives-ouvertes.fr/inria-00190865

E. C. Sherbrooke and N. M. Patrikalakis, Computation of the solutions of nonlinear polynomial systems, Computer Aided Geometric Design, vol.10, issue.5, pp.379-405, 1993.
DOI : 10.1016/0167-8396(93)90019-Y

M. Shub and S. Smale, Complexity of bezout's theorem i: Geometric aspects, Journal of the American Mathematical Society, vol.6, issue.2, pp.459-501, 1993.

E. P. Tsigaridas and I. Z. Emiris, On the complexity of real root isolation using continued fractions, Theoretical Computer Science, vol.392, issue.1-3, pp.158-173, 2008.
DOI : 10.1016/j.tcs.2007.10.010
URL : https://hal.archives-ouvertes.fr/inria-00116990

A. Van-der-poorten, An introduction to continued fractions, Diophantine analysis, pp.99-138, 1986.
DOI : 10.1017/CBO9780511721304.007

J. Zur-gathen and J. Gerhard, Fast algorithms for Taylor shifts and certain difference equations, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.40-47, 1997.
DOI : 10.1145/258726.258745

N. Michael and . Vrahatis, A short proof and a generalization of Miranda's existence theorem, Proceedings of the, pp.701-703, 1989.

J. C. Yakoubsohn, Approximating the zeros of analytic functions by the exclusion algorithm, Numerical Algorithms, vol.4, issue.1, pp.63-88, 1994.
DOI : 10.1007/BF02149763

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

Y. Yomdin and G. Comte, Tame geometry with applications in smooth analysis. LNM 1834, 2004.