L. Alberti, G. Comte, and B. Mourrain, Meshing implicit algebraic surfaces: the smooth case, Mathematical Methods for Curves and Surfaces: Tromso'04, pp.11-26, 2005.

W. Auzinger and H. J. Stetter, An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations, Proc. Intern. Conf. on Numerical Math, pp.12-30, 1988.
DOI : 10.1007/978-3-0348-6303-2_2

S. Basu, R. Pollack, and M. Roy, Algorithms in Real Algebraic Geometry, 2003.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

D. Bini, Numerical computation of polynomial zeros by means of Aberth's method, Numerical Algorithms, vol.8, issue.1, 1996.
DOI : 10.1007/BF02207694

L. Busé, H. Khalil, and B. Mourrain, Resultant-Based Methods for Plane Curves Intersection Problems, Proc. of the conf. Computer Algebra in Scientifc Computing, pp.75-92, 2005.
DOI : 10.1007/11555964_7

D. Cox, J. Little, and D. Shea, Ideals, Varieties, and Algorithms, Undergraduate Texts in Mathematics, 1997.

A. Dickenstein, M. J. Rojas, K. Rusekz, and J. Shihx, Extremal real algebraic geometry and A-discriminants, 2007.

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 and E. P. Tsigaridas, Univariate polynomial real root isolation: Continued fractions revisited, 14th Annual European Symposium on Algorithms, pp.817-828, 2006.

I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas, Real Algebraic Numbers: Complexity Analysis and Experimentation, Reliable Implementation of Real Number Algorithms: Theory and Practice, 2007.
DOI : 10.1007/978-3-540-85521-7_4

G. Farin, Curves and surfaces for computer aided geometric design : a practical guide. Comp. science and sci. computing, 1990.

M. S. Floater, On zero curves of bivariate polynomials, Advances in Computational Mathematics, vol.2, issue.1, pp.399-415, 1996.
DOI : 10.1007/BF02124753

J. C. Faugère and F. Rouillier, FGB/RS Gröbner basis computation and real root isolation

E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns: Abstraction and Reuse of Object-Oriented Design, Lecture Notes in Computer Science, vol.707, pp.406-431, 1993.
DOI : 10.1007/3-540-47910-4_21

T. Gunji, S. Kim, M. Kojima, A. Takeda, K. Fujisawa et al., PHoM ? a Polyhedral Homotopy Continuation Method for Polynomial Systems, Computing, vol.73, issue.1, pp.152-8552, 2002.
DOI : 10.1007/s00607-003-0032-4

V. Karamcheti, C. Li, I. Pechtchanski, and C. Yap, A core library for robust numeric and geometric computation, Proceedings of the fifteenth annual symposium on Computational geometry , SCG '99, 1999.
DOI : 10.1145/304893.304989

C. Liang, B. Mourrain, and J. P. Pavone, Subdivision Methods for the Topology of 2d and 3d Implicit Curves, Computational Methods for Algebraic Spline Surfaces, 2006.
DOI : 10.1007/978-3-540-72185-7_11
URL : https://hal.archives-ouvertes.fr/inria-00130216

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

H. Lombardi, M. Roy, and M. , New Structure Theorem for Subresultants, Special Issue Symbolic Computation in Algebra, Analysis, and Geometry, pp.663-690, 2000.
DOI : 10.1006/jsco.1999.0322

V. J. Milenkovic and E. Sacks, AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES, Proceedings of the 22th Annual Symposium on Computational Geometry, pp.237-245, 2006.
DOI : 10.1142/S021819590700229X

B. Mourrain, Computing isolated polynomial roots by matrix methods, J. of Symbolic Computation, Special Issue on Symbolic-Numeric Algebra for Polynomials, vol.26, issue.6, pp.715-738, 1998.
DOI : 10.1006/jsco.1998.0236
URL : http://doi.org/10.1006/jsco.1998.0236

B. Mourrain, A New Criterion for Normal Form Algorithms, Proc. AAECC, pp.430-443, 1999.
DOI : 10.1007/3-540-46796-3_41

B. Mourrain, Pythagore???s Dilemma, Symbolic-Numeric Computation, and the Border Basis Method, Mathematics and Visualisation, pp.223-243
DOI : 10.1007/978-3-7643-7984-1_14

B. Mourrain and J. Pavone, Subdivision methods for solving polynomial equations, Journal of Symbolic Computation, vol.44, issue.3, 2005.
DOI : 10.1016/j.jsc.2008.04.016
URL : https://hal.archives-ouvertes.fr/inria-00070350

B. Mourrain, . Ph, and . Trébuchet, Solving projective complete intersection faster, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.231-238, 2000.
DOI : 10.1145/345542.345642

B. Mourrain, . Ph, and . Trébuchet, Generalised normal forms and polynomial system solving, Proc. Intern. Symp. on Symbolic and Algebraic Computation, pp.253-260, 2005.

T. Ogita and S. Oishi, Fast Inclusion of Interval Matrix Multiplication, Reliable Computing, vol.27, issue.1???2, pp.191-205, 2005.
DOI : 10.1007/s11155-005-3615-2

J. P. Pavone, Auto-intersection de surfaces pamatrées réelles, 2004.

F. Rouillier and P. Zimmermann, Efficient isolation of polynomial's real roots, Journal of Computational and Applied Mathematics, vol.162, issue.1, pp.33-50, 2003.
DOI : 10.1016/j.cam.2003.08.015

S. Rump, Computational error bounds for multiple or nearly multiple eigenvalues, Linear Algebra and its Applications, vol.324, issue.1-3, pp.209-226, 2001.
DOI : 10.1016/S0024-3795(00)00279-2

E. C. Sherbrooke and N. M. Patrikalakis, Computation of the solutions of nonlinear polynomial systems, Computer Aided Geometric Design, vol.10, issue.5, pp.379-405, 1993.
DOI : 10.1016/0167-8396(93)90019-Y

H. J. Stetter, Numerical polynomial algebra, Society for Industrial and Applied Mathematics (SIAM), 2004.
DOI : 10.1137/1.9780898717976

. Ph and . Trébuchet, Vers une résolution stable et rapide deséquationsdeséquations algébriques, 2002.

J. Verschelde, Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation, ACM Transactions on Mathematical Software, vol.25, issue.2, pp.251-276, 1999.
DOI : 10.1145/317275.317286

J. Zur-gathen and J. Gerhard, Modern computer algebra, 1999.
DOI : 10.1017/CBO9781139856065

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