A. Baker and G. Wüstholz, Logarithmic forms and group varieties, J. Reine Angew. Math, vol.442, pp.19-623457, 1993.

O. Bastani, J. Christopher, D. Hillar, M. Popov, and . Rojas, Randomization, sums of squares, near-circuits, and faster real root counting, Contemporary Mathematics, vol.556, p.145166, 2011.
DOI : 10.1090/conm/556/11012

Y. Bugeaud, A. Dujella, T. Pejkovic, and B. Salvy, Absolute real root separation. arXiv preprint, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01655531

Y. Bugeaud and M. Mignotte, POLYNOMIAL ROOT SEPARATION, International Journal of Number Theory, vol.71, issue.03, p.587602, 2010.
DOI : 10.1007/BFb0073786

F. Cucker, P. Koiran, and S. Smale, A polynomial time algorithm for diophantine equations in one variable, Journal of Symbolic Computation, vol.27, issue.1, p.2129, 1999.

K. Etessami, A. Stewart, and M. Yannakakis, A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing, ACM Transactions on Computation Theory, vol.6, issue.2, p.9, 2014.
DOI : 10.4153/CJM-1993-010-1

G. Jindal and M. Sagralo, Eciently computing real roots of sparse polyonmials, Proc. ISSAC 2017 (42nd International Symposium on Symbolic and Algebraic Computation, 2017.

G. Jindal and M. Sagralo, Eciently computing real roots of sparse polyonmials

H. W. Lenstra, Finding small degree factors of lacunary polynomials, Number Theory in Progress, p.267276, 1999.
DOI : 10.1515/9783110285581.267

K. Mahler, An inequality for the discriminant of a polynomial., The Michigan Mathematical Journal, vol.11, issue.3, p.257262, 1964.
DOI : 10.1307/mmj/1028999140

M. Marden, Geometry of polynomials. Number 3 in Mathematical Surveys and Monographs, 1966.

M. Marden, The Search for a Rolle's Theorem in the Complex Domain, The American Mathematical Monthly, vol.92, issue.9, p.643650, 1985.
DOI : 10.2307/2323710

M. Mignotte, Some useful bounds, Computer algebra, p.259263, 1982.
DOI : 10.1007/978-3-7091-3406-1_16

M. Rojas and Y. Ye, On solving univariate sparse polynomials in logarithmic time, Journal of Complexity, vol.21, issue.1, p.87110, 2005.
DOI : 10.1016/j.jco.2004.03.004

M. Sagralo, A near-optimal algorithm for computing real roots of sparse polynomials, Proc. ISSAC 2014 (39th International Symposium on Symbolic and Algebraic Computation), p.359366, 2014.