Y. Bugeaud and M. Mignotte, ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS, Proceedings of the Edinburgh Mathematical Society, vol.47, issue.3, pp.553-556, 2004.
DOI : 10.1017/S0013091503000257

C. Burnikel, S. Funke, K. Melhorn, S. Schirra, and S. Schmitt, A Separation Bound for Real Algebraic Expressions, Lecture Notes in Computer Science, pp.254-265, 2001.
DOI : 10.1007/s00453-007-9132-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7887

G. Collins and E. Horowitz, The minimum root separation of a polynomial, Mathematics of Computation, vol.28, issue.126, pp.589-597, 1974.
DOI : 10.1090/S0025-5718-1974-0345940-X

D. Cox, J. Little, and D. Shea, Using Algebraic Geometry, 2005.
DOI : 10.1007/978-1-4757-6911-1

C. D. Andrea and M. Sombra, A Poisson Formula for the Sparse Resultant, Proc. London Math. Soc. (3) 110, pp.932964-2015

I. Emiris, B. Mourrain, and E. Tsigaridas, The DMM bound, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.243-250, 2010.
DOI : 10.1145/1837934.1837981
URL : https://hal.archives-ouvertes.fr/inria-00393833

I. Emiris and E. Tsigaridas, Comparing Real Algebraic Numbers of Small Degree, Lecture Notes in Computer Science, vol.3221, 2004.
DOI : 10.1007/978-3-540-30140-0_58

L. Gonzalez-vega and N. Gonzalez-campos, Simultaneous Elimination by using Several Tools from Real Algebraic Geometry, Journal of Symbolic Computation, vol.28, issue.1-2, pp.89-103, 1999.
DOI : 10.1006/jsco.1998.0268
URL : http://doi.org/10.1006/jsco.1998.0268

A. Herman and H. Hong, Quality of positive root bounds, Journal of Symbolic Computation, vol.74, pp.592-602, 2015.
DOI : 10.1016/j.jsc.2015.09.006

C. Li, S. Pion, and C. Yap, Recent progress in exact geometric computation, The Journal of Logic and Algebraic Programming, vol.64, issue.1, pp.85-111, 2004.
DOI : 10.1016/j.jlap.2004.07.006
URL : https://hal.archives-ouvertes.fr/inria-00344355

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

K. Melhorn 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, An inequality about factors of polynomials, Mathematics of Computation, vol.28, issue.128, pp.1153-1157, 1974.
DOI : 10.1090/S0025-5718-1974-0354624-3

M. Mignotte, On the distance between the roots of a polynomial, Applicable Algebra in Engineering, Communication, and Computing, pp.327-332, 1995.
DOI : 10.1007/BF01198012

S. Rump, Polynomial minimum root separation, Mathematics of Computation, vol.33, issue.145, pp.327-336, 1979.
DOI : 10.1090/S0025-5718-1979-0514828-8
URL : http://tubdok.tub.tuhh.de/bitstream/11420/305/1/Ru79.pdf

C. Schultz and R. Moller, Quantifier Elimination over Real Closed Fields in the Context of Applied Description Logics, 2005.

A. Strzebonksi and E. Tsigaridas, Univariate Real Root Isolation in an Extension Field and Applications. hal-01248390, 2011.

E. Tsigaridas and I. 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