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. 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

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.
DOI : 10.1007/978-3-662-43799-5_4

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

Y. Bouzidi, S. Lazard, M. Pouget, and F. Rouillier, Separating linear forms and rational univariate representations of bivariate systems URL https, Journal of Symbolic Computation, pp.84-119, 2015.
DOI : 10.1016/j.jsc.2014.08.009

J. Cheng, X. Gao, and C. Yap, Complete numerical isolation of real roots in zero-dimensional triangular systems, Journal of Symbolic Computation, vol.44, issue.7, pp.768-785, 2009.
DOI : 10.1016/j.jsc.2008.04.017

G. Collins and A. Akritas, Polynomial real root isolation using Descartes' rule of signs, SYMSAC '76, pp.272-275, 1976.
DOI : 10.1145/800205.806346

G. E. Collins and R. Loos, Polynomial real root isolation by differentiation, Proceedings of the third ACM symposium on Symbolic and algebraic computation , SYMSAC '76, pp.15-25, 1976.
DOI : 10.1145/800205.806319

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´ruleDescartes´rule of signs, 2008.

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.
DOI : 10.1007/11555964_12

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://domino.mpi-inf.mpg.de/intranet/ag1/ag1publ.nsf/AuthorEditorIndividualView/6e09cb7fbe62ea64c12571b20040a5d4/$FILE/ESY-DescTree-ISSAC06-authprep.pdf?OpenElement

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.

P. Escorcielo and D. Perrucci, On the davenport-mahler bound. arXiv preprint, 2016.
DOI : 10.1016/j.jco.2016.12.001

W. Hart and A. Novocin, Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic, Proc. CASC, pp.200-214, 2011.
DOI : 10.1007/978-1-4612-0129-8

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

J. Johnson and W. Krandick, Polynomial real root isolation using approximate arithmetic, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.225-232, 1997.
DOI : 10.1145/258726.258790

URL : http://www.uni-paderborn.de/cs/ag-monien/PERSONAL/KRANDICK/papers/issac97.ps.Z

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

T. Lickteig and M. Roy, Sylvester???Habicht Sequences and Fast Cauchy Index Computation, Journal of Symbolic Computation, vol.31, issue.3, pp.315-341, 2001.
DOI : 10.1006/jsco.2000.0427

URL : https://doi.org/10.1006/jsco.2000.0427

R. Loos, B. Buchberger, G. E. Collins, R. Loos, and R. Albrecht, Computing in algebraic extensions, Computer Algebra: Symbolic and Algebraic Computation, pp.173-187, 1983.
DOI : 10.1007/978-3-7091-3406-1_12

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, Journal of Symbolic Computation, vol.46, issue.1, pp.70-90, 2011.
DOI : 10.1016/j.jsc.2010.09.004

K. Mehlhorn, M. Sagraloff, and P. Wang, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Journal of Symbolic Computation, vol.66, issue.0, pp.34-69, 2015.
DOI : 10.1016/j.jsc.2014.02.001

URL : http://arxiv.org/pdf/1301.4870

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

B. Mourrain, M. Vrahatis, and J. Yakoubsohn, On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree, Journal of Complexity, vol.18, issue.2, 2002.
DOI : 10.1006/jcom.2001.0636

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 : https://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. Tsigaridas, Nearly Optimal Computations with Structured Matrices, Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, pp.21-30, 2014.
DOI : 10.1145/2631948.2631954

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

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

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

V. Y. Pan and E. Tsigaridas, Nearly optimal computations with structured matrices (journal version) URL https, 2015.
DOI : 10.1145/2631948.2631954

V. Y. Pan and E. P. Tsigaridas, On the boolean complexity of real root refinement, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pp.299-306, 2013.
DOI : 10.1145/2465506.2465938

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

C. Pascal and E. Schost, Change of order for bivariate triangular sets, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.277-284, 2006.
DOI : 10.1145/1145768.1145814

R. Rioboo, Towards faster real algebraic numbers, Journal of Symbolic Computation, vol.36, issue.3-4, pp.513-533, 2003.
DOI : 10.1016/S0747-7171(03)00093-2

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

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

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

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

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, pp.297-304, 2012.
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. 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.

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

M. Van-hoeij and M. Monagan, A modular GCD algorithm over number fields presented with multiple extensions, Proceedings of the 2002 international symposium on Symbolic and algebraic computation , ISSAC '02, pp.109-116, 2002.
DOI : 10.1145/780506.780520

B. Xia and L. Yang, An Algorithm for Isolating the Real Solutions of Semi-algebraic Systems, Journal of Symbolic Computation, vol.34, issue.5, pp.461-477, 2002.
DOI : 10.1006/jsco.2002.0572

B. Xia and T. Zhang, Real solution isolation using interval arithmetic, Computers & Mathematics with Applications, vol.52, issue.6-7, pp.853-860, 2006.
DOI : 10.1016/j.camwa.2006.06.003

URL : https://doi.org/10.1016/j.camwa.2006.06.003

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