S. Y. Bouzidi, G. Lazard, M. Moroz, F. Pouget, M. Rouillier et al., Improved 363 algorithms for solving bivariate systems via Rational Univariate Representations. Re- 364 search report, 2015.

B. Y. Bouzidi, S. Lazard, M. Pouget, F. Rouillier, ]. S. Basu et al., Separating linear forms and 366 rational univariate representations of bivariate systems, Algorithms in Real Algebraic Geometry, pp.367-84

D. Cox, J. Little, and D. Shea, Using Algebraic Geometry. Number 185 in Graduate 371 Texts in Mathematics On the asymptotic and practical 373 complexity of solving bivariate systems over the reals, 369 of Algorithms and Computation in Mathematics, pp.370-372, 2005.
DOI : 10.1007/978-1-4757-6911-1

M. Kahoui, An elementary approach to subresultants theory, Journal of Symbolic Computation, vol.35, issue.3, pp.35281-292, 2003.
DOI : 10.1016/S0747-7171(02)00135-9

G. , L. González-vega, and M. Kahoui, An improved upper complexity bound for the 378 topology computation of a real algebraic plane curve, J. of Complexity, vol.12, issue.379, pp.527-544, 1996.

L. X. Li, M. Moreno-maza, R. Rasheed, and . Schost, The modpn library, ACM SIGSAM Bulletin, vol.42, issue.3, pp.841-858, 2011.
DOI : 10.1145/1504347.1504374

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
URL : http://doi.org/10.1006/jsco.2000.0427

E. Mehrabi and . Schost, A quasi-optimal monte carlo algorithm for the symbolic 385 solution of polynomial systems in Z[x, y]. Manuscript, 2015. 386 [Rei97] D. Reischert. Asymptotically fast computation of subresultants, Proceedings of the 387 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC'97, pp.233-240, 1997.

R. Seidel and N. Wolpert, On the exact computation of the topology of real algebraic 390 curves, Proc 21st ACM Symposium on Computational Geometry, pp.107-115