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

D. Armentano and J. Dedieu, A note about the average number of real roots of a Bernstein polynomial system, Journal of Complexity, vol.25, issue.4, pp.339-342, 2009.
DOI : 10.1016/j.jco.2009.03.001

A. T. Bharucha-reid and M. Sambandham, Random Polynomials, 1986.

P. Bleher and X. Di, Correlations between zeros of a random polynomial, Journal of Statistical Physics, vol.13, issue.3, pp.269-305, 1997.
DOI : 10.1007/BF02508472

A. Bloch and G. Polya, On the Roots of Certain Algebraic Equations, Proc. London Math. Soc, pp.102-114, 1932.
DOI : 10.1112/plms/s2-33.1.102

C. Chen and F. Qi, The best bound in Wallis' inequality, Proc. AMS, pp.397-401, 2004.

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. Edelman and E. Kostlan, How many zeros of a random polynomial are real?, Bulletin of the American Mathematical Society, vol.32, issue.1, pp.1-37, 1995.
DOI : 10.1090/S0273-0979-1995-00571-9

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

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

P. Erdös and P. Turán, On the Distribution of Roots of Polynomials, The Annals of Mathematics, vol.51, issue.1, pp.105-119, 1950.
DOI : 10.2307/1969500

J. M. Hammersley, The zeros of a random polynomial, Proc. of the 3rd Berkeley Symposium on Mathematical Statistics and Probability, pp.89-111, 1954.

J. H. Hannay, Chaotic analytic zero points: exact statistics for those of a random spin state, Journal of Physics A: Mathematical and General, vol.29, issue.5, pp.101-105, 1996.
DOI : 10.1088/0305-4470/29/5/004

L. E. Heindel, Integer Arithmetic Algorithms for Polynomial Real Zero Determination, Journal of the ACM, vol.18, issue.4, pp.533-548, 1971.
DOI : 10.1145/321662.321667

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

C. P. Hughes and A. Nikeghbali, Abstract, Compositio Mathematica, vol.144, issue.03, pp.734-746, 2008.
DOI : 10.1112/S0010437X07003302

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

J. R. Johnson, W. Krandick, K. Lynch, D. Richardson, and A. Ruslanov, High-performance implementations of the Descartes method, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.154-161, 2006.
DOI : 10.1145/1145768.1145797

M. Kac, On the average number of real roots of a random algebraic equation, Bulletin of the American Mathematical Society, vol.49, issue.4, pp.314-320, 1943.
DOI : 10.1090/S0002-9904-1943-07912-8

E. Kowalski, Bernstein Polynomials and Brownian Motion, The American Mathematical Monthly, vol.113, issue.10, pp.865-886, 2006.
DOI : 10.2307/27642086
URL : https://hal.archives-ouvertes.fr/hal-00180766

W. Krandick, Isolierung reeller nullstellen von polynomen, Wissenschaftliches Rechnen, pp.105-154, 1995.

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

J. E. Littlewood and A. C. Offord, On the number of real roots of a random algebraic equation, J. London Math. Soc, vol.13, pp.288-295, 1938.

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

M. Mignotte and D. , Polynomials: An algorithmic approach, 1999.

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

D. Reischert, Asymptotically fast computation of subresultants, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.233-240, 1997.
DOI : 10.1145/258726.258792

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

G. Schehr and S. N. Majumdar, Real Roots of Random Polynomials and Zero Crossing Properties of Diffusion Equation, Journal of Statistical Physics, vol.129, issue.2, pp.235-273, 2008.
DOI : 10.1007/s10955-008-9574-3
URL : https://hal.archives-ouvertes.fr/hal-00273560

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

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

M. Shub and S. Smale, Complexity of bézout's theorem II: volumes and probabilities, Computational Algebraic Geometry, pp.267-285, 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

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