A. G. Akritas and A. Strzebo´nskistrzebo´nski, A comparative study of two real root isolation methods. Nonlinear Analysis: Modelling and Control, pp.297-304, 2005.

F. Boulier, C. Chen, F. Lemaire, and M. M. Maza, Real root isolation of regular chains, Proc. Asian Symposium on Computer Mathematics (ASCM), pp.1-15, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00825036

W. D. Brownawell and C. K. Yap, Lower bounds for zerodimensional projections, Proc. 34th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), 2009.

C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt, A separation bound for real algebraic expressions, Algorithmica, vol.55, issue.1, pp.14-28, 2009.

J. Canny, The Complexity of Robot Motion Planning, ACM Doctoral Dissertation Award Series, 1987.

J. Canny, E. Kaltofen, and Y. Lakshman, Solving systems of non-linear polynomial equations faster, Proc. ACM Intern. Symp. on Symbolic & Algebraic Comput, pp.121-128, 1989.

C. Chen and M. M. Maza, Algorithms for computing triangular decompositions of polynomial systems, Proc. 36th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), pp.83-90, 2011.

C. Chen and M. M. Maza, Algorithms for computing triangular decompositions of polynomial systems by, J. Symbolic Computation, 2012.

J. Cheng and X. Gao, Multiplicity preserving triangular set decomposition of two polynomials, 2011.

J. Cheng, X. Gao, and C. Yap, Complete numerical isolation of real roots in zero-dimensional triangular systems

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, J. Symbolic Computation, vol.44, issue.7, pp.818-835, 2009.

Z. Du, V. Sharma, and C. K. Yap, Amortized bound for root isolation via Sturm sequences Real root isolation for exact and approximate polynomials using Descartes´ruleDescartes´rule of signs, Int. Workshop on Symbolic Numeric Computing, pp.113-129, 2005.

A. Eigenwillig, L. Kettner, W. Krandick, K. Mehlhorn, S. Schmitt et al., A Descartes Algorithm for Polynomials with Bit-Stream Coefficients, LNCS, vol.3718, pp.138-149, 2005.

I. Emiris and V. Pan, Improved algorithms for computing determinants and resultants, J. Complexity, Special Issue, vol.21, pp.43-71, 2005.

I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas, The DMM bound: Multivariate (aggregate) separation bounds, Proc. 35th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), pp.243-250, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00393833

J. Johnson and W. Krandick, Polynomial real root isolation using approximate arithmetic, Proc. Int'l Symp. on Symbolic and Algebraic Comp. (ISSAC), pp.225-232, 1997.

J. R. Johnson, Algorithms for Polynomial Real Root Isolation, 1991.

M. Kerber and M. Sagraloff, Efficient real root approximation, Proc. 36th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), pp.209-216, 2011.
DOI : 10.1145/1993886.1993920
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.475

Z. Lu, B. He, Y. Luo, and L. Pan, An algorithm of real root isolation for polynomial system, Proc. 1st ACM Int'l Work. Symbolic Numeric Computation (SNC), pp.94-107, 2005.

K. Mehlhorn and M. Sagraloff, A deterministic algorithm for isolating real roots of a real polynomial, J. Symbolic Computation, vol.46, issue.1, pp.70-90, 2011.

M. Mignotte, Mathematics for Computer Algebra, 1991.

V. Pan, Univariate polynomials: Nearly optimal algorithms for numerical factorization and rootfinding, J. Symbolic Computation, vol.33, issue.5, pp.701-733, 2002.

C. Pascal and E. Schost, Change of order for bivariate triangular sets, Proc. 31th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), Pages, pp.277-284, 2006.

R. Rioboo, Towards faster real algebraic numbers, Proc. Annual ACM ISSAC, pp.221-228, 2002.
DOI : 10.1016/s0747-7171(03)00093-2
URL : https://hal.archives-ouvertes.fr/hal-01199502

R. Rioboo, Towards faster real algebraic numbers, J. Symb. Comput, vol.36, issue.3-4, pp.513-533, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01199502

F. Rouillier and Z. Zimmermann, Efficient isolation of polynomial's real roots, J. of Computational and Applied Mathematics, vol.162, issue.1, pp.33-50, 2004.

S. Rump, On the sign of a real algebraic number, SYMSAC '76: Proceedings of the third ACM symposium on Symbolic and algebraic computation, pp.238-241, 1976.

S. M. Rump, Real root isolation for algebraic polynomials, ACM SIGSAM Bulletin, vol.11, issue.2, pp.327-336, 1977.
DOI : 10.1145/1088240.1088241
URL : http://tubdok.tub.tuhh.de/bitstream/11420/317/1/Ru77.pdf

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

M. Sagraloff, When Newton meets Descartes: A simple and fast algorithm to isolate the real roots of a polynomial The fundamental theorem of algebra in terms of computational complexity, Proc. 37th ACM Int'l Symp. on Symbolic & Algebraic Comp.(ISSAC), 2012. [33] A. Schönhage, 1982.

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.

B. Xia and L. Yang, An algorithm for isolating the real solutions of semi-algebraic systems, J. Symbolic Computation, vol.34, pp.461-477, 2002.

B. Xia and T. Zhang, Real solution isolation using interval arithmetic, Comput. Math. Appl, vol.52, pp.853-860, 2006.

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