A. Akritas, An implementation of Vincent's theorem, Numerische Mathematik, vol.1, issue.1, pp.53-62, 1980.
DOI : 10.1007/BF01395988

A. Akritas, There is no "Uspensky's method". Extended Abstract, Proc. Symp. on Symbolic and Algebraic Computation, pp.88-90, 1986.

A. Akritas, Elements of Computer Algebra with Applications, J. Wiley & Sons, 1989.

A. Akritas, W. Strzebó, and P. S. Vigklas, Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials, Computing, vol.1, issue.12, pp.355-367, 2006.
DOI : 10.1007/s00607-006-0186-y

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

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. Collins and R. Loos, Real zeros of polynomials, Computer Algebra: Symbolic and Algebraic Computation, pp.83-94, 1982.

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

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, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.7463

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

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, LNCS, vol.5045, pp.57-82, 2008.

I. Z. Emiris, V. Y. Pan, and E. P. Tsigaridas, Algebraic and numerical algorithms Computing Handbook Set -Computer Science, volume I, chapter, 2012.

H. Hong, Bounds for Absolute Positiveness of Multivariate Polynomials, Journal of Symbolic Computation, vol.25, issue.5, pp.571-585, 1998.
DOI : 10.1006/jsco.1997.0189

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

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

W. Krandick, Isolierung reeller Nullstellen von Polynomen, Wissenschaftliches Rechnen, pp.105-154, 1995.

W. Krandick and K. Mehlhorn, New bounds for the Descartes method, JSC, vol.41, issue.1, pp.49-66, 2006.

S. Kwek and K. Mehlhorn, Optimal search for rationals, Information Processing Letters, vol.86, issue.1, pp.23-26, 2003.
DOI : 10.1016/S0020-0190(02)00455-6
URL : http://hdl.handle.net/11858/00-001M-0000-000F-2DAA-A

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

K. Mehlhorn and M. Sagraloff, A deterministic algorithm for isolating real roots of a real polynomial, Journal of Symbolic Computation, vol.46, issue.1, pp.70-90, 2011.
DOI : 10.1016/j.jsc.2010.09.004

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

C. Neff and J. Reif, An o(n 1+ log b) algorithm for the complex root problem, Proc. IEEE Symp. Foundations of Computer Science, pp.540-547, 1994.

V. 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. Pan, Solving Polynomials with Computers, American Scientist, vol.86, issue.1, pp.62-69, 1998.
DOI : 10.1511/1998.17.915

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, B. Murphy, R. Rosholt, G. Qian, and Y. Tang, Real root-finding, Proc. of the 2007 Int. Workshop on Symbolic-Numeric Computation (SNC), pp.161-169, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01105309

F. Rouillier and Z. Zimmermann, Efficient isolation of polynomial's real roots, Journal of Computational and Applied Mathematics, vol.162, issue.1, pp.33-50, 2004.
DOI : 10.1016/j.cam.2003.08.015

M. Sagraloff, On the complexity of real root isolation. CoRR, abs, 1011.

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

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

A. Schönhage, Equation solving in terms of computational complexity, Proc. Int. Congress of Mathematics, pp.131-153, 1986.

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. P. Tsigaridas, Improved complexity bounds for real root isolation using Continued Fractions, Proc. 4th Int'l Conf. on Mathematical Aspects of Computer Information Sciences (MACIS), pp.226-237, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00524834

E. P. Tsigaridas and I. Z. Emiris, Univariate Polynomial Real Root Isolation: Continued Fractions Revisited, Proc. 14th European Symp. of Algorithms (ESA), pp.817-828, 2006.
DOI : 10.1007/11841036_72
URL : http://arxiv.org/abs/cs/0604066

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

J. V. Uspensky, Theory of Equations, 1948.

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

A. J. Vincent, Sur la résolution des équations numériques, J. Math. Pures Appl, vol.1, pp.341-372, 1836.

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

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