M. Alonso, E. Becker, M. Roy, and T. Wörmann, Multiplicities and idempotents for zerodimensional systems, Algorithms in Algebraic Geometry and Applications, pp.1-20, 1996.

J. [. Alefeld and . Herzberger, Introduction to Interval Computations, 1983.

H. [. Busé, B. Khalil, and . Mourrain, Resultant-Based Methods for Plane Curves Intersection Problems, Computer Algebra in Scientific Computing (CASC), pp.75-92, 2005.
DOI : 10.1007/11555964_7

S. [. Bouzidi, M. Lazard, F. Pouget, and . Rouillier, New bivariate system solver and topology of algebraic curves, 27th European Workshop on Computational Geometry -EuroCG, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00580431

Y. Bouzidi, S. Lazard, M. Pouget, and F. Rouillier, Separating linear forms for bivariate systems, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, 2013.
DOI : 10.1145/2465506.2465518

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

R. [. Basu, M. Pollack, and . 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

]. J. Can87 and . Canny, A new algebraic method for robot motion planning and real geometry, Proceedings of the 28th Annual Symposium on Foundations of Computer Science, SFCS '87, pp.39-48, 1987.

J. Cheng, X. Gao, and C. K. Yap, Complete numerical isolation of real zeros in zerodimensional triangular systems, Proc. Int. Symp. on Symbolic and Algebraic Computation, pp.92-99, 2007.

S. J. Cheng, L. Lazard, M. Peñaranda, F. Pouget, E. Rouillier et al., On the topology of real algebraic plane curves On the asymptotic and practical complexity of solving bivariate systems over the reals An elementary approach to subresultants theory, Mathematics in Computer Science I. Diochnos, I. Z. Emiris, J. Symb. Comput. J. Symb. Comput, vol.4, issue.353, pp.113-137818, 2003.

M. [. Emeliyanenko and . Sagraloff, On the complexity of solving a bivariate polynomial system, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, p.12, 2012.
DOI : 10.1145/2442829.2442854

F. [. Lemaire, C. Boulier, M. M. Chen, and . Maza, Real root isolation of regular chains, Proceedings of the 2009 Asian Symposium on Computer Mathematics Math for Industry, pp.1-15, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00825036

]. W. Ful08 and . Fulton, Algebraic curves: an introduction to algebraic geometry Personal reprint made available by the author, 2008.

M. [. González-vega and . Kahoui, An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve, Journal of Complexity, vol.12, issue.4, pp.527-544, 1996.
DOI : 10.1006/jcom.1996.0032

I. [. González-vega and . Necula, Efficient topology determination of implicitly defined algebraic plane curves, Computer Aided Geometric Design, vol.19, issue.9, 2002.
DOI : 10.1016/S0167-8396(02)00167-X

]. H. Lom90 and . Lombardi, Sous-Résultant, suite de Sturm, spécialisation, 1990.

M. [. Lickteig and . 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 : http://doi.org/10.1006/jsco.2000.0427

]. M. Mig89 and . Mignotte, Mathématiques pour le calcul formel Asymptotically fast computation of subresultants, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, ISSAC '97, pp.233-240, 1989.

]. F. Rou99, M. Rouillier, and . Roy, Solving zero-dimensional systems through the rational univariate representation Basic algorithms in real algebraic geometry and their complexity : from Strum theorem to the existential theory of reals. Lectures on Real Geometry in memoriam of Mario Raimondo, J. of Applicable Algebra in Engineering Communication and Computing Gruyter Expositions in Mathematics, vol.9, issue.23, pp.433-4611, 1996.

]. S. Rum79 and . Rump, Polynomial minimum root separation, Mathematics of Computation, vol.33, issue.145, pp.327-336, 1979.

]. M. Sag12 and . Sagraloff, When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial, Proceedings of the 37th international symposium on Symbolic and algebraic computation, p.12, 2012.

]. E. Sch01 and . Schost, Sur la Résolution des Systèmes Polynomiaux à Paramètres, 2001.

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

]. C. Yap00 and . Yap, Fundamental Problems of Algorithmic Algebra, 2000.

H. [. Zomorodian and . Edelsbrunner, FAST SOFTWARE FOR BOX INTERSECTIONS, Inria RESEARCH CENTRE NANCY ? GRAND EST 615 rue du Jardin Botanique CS20101 54603 Villers-lès-Nancy Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria.fr ISSN, pp.143-172, 2002.
DOI : 10.1142/S0218195902000785