P. Aubry, D. Lazard, and M. M. Maza, On the theories of triangular sets, Journal of Symbolic Computation, vol.28, issue.1, pp.105-124, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01148870

D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler, Bertini: Software for numerical algebraic geometry. Available at bertini.nd.edu with permanent doi: dx

P. Batra, Globally convergent, iterative path-following for algebraic equations, Math. in Computer Sci, vol.4, issue.4, pp.507-537, 2010.

R. Becker, M. Sagraloff, V. Sharma, J. Xu, and C. Yap, Complexity analysis of root clustering for a complex polynomial, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, vol.16, pp.71-78, 2016.

R. Becker, M. Sagraloff, V. Sharma, and C. Yap, A near-optimal subdivision algorithm for complex root isolation based on Pellet test and Newton iteration, J. Symbolic Computation, vol.86, pp.51-96, 2018.

C. Beltrán and A. Leykin, Certified numerical homotopy tracking, Experimental Mathematics, vol.21, issue.1, pp.69-83, 2012.

F. Boulier, C. Chen, F. Lemaire, and M. Moreno-maza, Real root isolation of regular chains, Computer Mathematics, pp.33-48
URL : https://hal.archives-ouvertes.fr/hal-00825036

H. Springer-berlin, , 2014.

J. S. Cheng, X. S. Gao, and C. K. Yap, Complete numerical isolation of real roots in zero-dimensional triangular systems, Journal of Symbolic Computation, vol.44, issue.7, pp.768-785, 2009.

G. E. Collins, J. R. Johnson, and W. Krandick, Interval arithmetic in cylindrical algebraic decomposition, Journal of Symbolic Computation, vol.34, issue.2, pp.145-157, 2002.

X. Dahan, M. M. Maza, E. Schost, W. Wu, and Y. Xie, Lifting techniques for triangular decompositions, Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation. pp. 108-115. ISSAC '05, 2005.

G. Darboux, Sur les développements en série des fonctions d'une seule variable, Journal de mathématiques pures et appliquées (Liouville Journal), vol.3, pp.291-312, 1876.

B. H. Dayton and Z. Zeng, Computing the multiplicity structure in solving polynomial systems, Proceedings of the 2005 international symposium on Symbolic and algebraic computation, pp.116-123, 2005.

A. Dickenstein, Solving Polynomial Equations: Foundations, Algorithms, and Applications, 2005.

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

M. Giusti, G. Lecerf, B. Salvy, and J. C. Yakoubsohn, On location and approximation of clusters of zeros: Case of embedding dimension one, Foundations of Computational Mathematics, vol.7, issue.1, pp.1-58, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00186739

B. Huber and B. Sturmfels, A polyhedral method for solving sparse polynomial systems, Mathematics of computation, vol.64, issue.212, pp.1541-1555, 1995.

R. Imbach, V. Y. Pan, and C. Yap, Implementation of a near-optimal complex root clustering algorithm, Mathematical Software -ICMS 2018, pp.235-244, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02077920

F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic, IEEE Transactions on Computers, vol.66, pp.1281-1292, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01394258

A. Kobel, F. Rouillier, and M. Sagraloff, Computing real roots of real polynomials ... and now for real, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, vol.16, pp.303-310, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01363955

J. Li, J. Cheng, and E. Tsigaridas, Local Generic Position for Root Isolation of Zerodimensional Triangular Polynomial Systems, CASC 2012 -14th International Workshop on Computer Algebra in Scientific Computing, vol.7442, pp.186-197, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00776212

M. Mignotte, On the distance between the roots of a polynomial, Communication and Computing, vol.6, issue.6, pp.327-332, 1995.

R. E. Moore, R. B. Kearfott, and M. J. Cloud, Introduction to interval analysis, 2009.

D. Niang-diatta, S. Diatta, F. Rouillier, M. F. Roy, and M. Sagraloff, Bounds for polynomials on algebraic numbers and application to curve topology, 2018.

A. Strzebonski and E. Tsigaridas, Univariate real root isolation in an extension field and applications, Journal of Symbolic Computation, vol.92, pp.31-51, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01248390

I. C. Wampler, The Numerical solution of systems of polynomials arising in engineering and science, 2005.

J. Xu, M. Burr, and C. Yap, An approach for certifying homotopy continuation paths: Univariate case, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, vol.18, pp.399-406, 2018.

C. Yap, M. Sagraloff, and V. Sharma, Analytic root clustering: A complete algorithm using soft zero tests, The Nature of Computation. Logic, Algorithms, Applications. LNCS, vol.7921, pp.434-444, 2013.

Z. Zhang, T. Fang, and B. Xia, Real solution isolation with multiplicity of zerodimensional triangular systems, Science China Information Sciences, vol.54, issue.1, pp.60-69, 2011.