P. Aubry and A. Valibouze, Using Galois Ideals for Computing Relative Resolvents, Journal of Symbolic Computation, vol.30, issue.6, pp.635-651, 2000.
DOI : 10.1006/jsco.2000.0376
URL : https://hal.archives-ouvertes.fr/inria-00099277

E. Berberich, P. Emeliyanenko, and M. Sagraloff, An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks, ALENEX, pp.35-47, 2011.
DOI : 10.1137/1.9781611972917.4

A. Bostan, M. F. Chowdhury, R. Lebreton, B. Salvy, and É. Schost, Power series solutions of singular (q)-differential equations, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.107-114, 2012.
DOI : 10.1145/2442829.2442848
URL : https://hal.archives-ouvertes.fr/hal-00697733

A. Bostan, P. Flajolet, B. Salvy, and É. Schost, Fast computation of special resultants, Journal of Symbolic Computation, vol.41, issue.1, pp.1-29, 2006.
DOI : 10.1016/j.jsc.2005.07.001
URL : https://hal.archives-ouvertes.fr/inria-00000960

Y. Bouzidi, S. Lazard, G. Moroz, M. Pouget, and F. Rouillier, Improved algorithm for computing separating linear forms for bivariate systems, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.75-82, 2014.
DOI : 10.1145/2608628.2608668
URL : https://hal.archives-ouvertes.fr/hal-00992634

Y. Bouzidi, S. Lazard, G. Moroz, M. Pouget, F. Rouillier et al., Improved algorithms for solving bivariate systems via Rational Univariate Representations, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01114767

Y. Bouzidi, S. Lazard, M. Pouget, and F. Rouillier, Rational univariate representations of bivariate systems and applications, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pp.109-116, 2013.
DOI : 10.1145/2465506.2465519
URL : https://hal.archives-ouvertes.fr/hal-00802698

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, pp.117-124, 2013.
DOI : 10.1145/2465506.2465518
URL : https://hal.archives-ouvertes.fr/hal-00809425

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

X. Caruso, Resultants and subresultants of p-adic polynomials, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01179866

D. Cox, J. Little, and D. Shea, Using algebraic geometry. Graduate Texts in Mathematics, 1998.

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

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

J. Zur-gathen and T. Lücking, Subresultants revisited, Theoretical Computer Science, vol.297, issue.1-3, pp.199-239, 2003.
DOI : 10.1016/S0304-3975(02)00639-4

J. Zur-gathen and V. Shoup, Computing Frobenius maps and factoring polynomials, computational complexity, vol.10, issue.2, pp.187-224, 1992.
DOI : 10.1007/BF01272074

I. Gelfand, M. Kapranov, and A. Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants. Modern Birkhäuser Classics, 2008.

M. Giusti, G. Lecerf, and B. Salvy, A Gr??bner Free Alternative for Polynomial System Solving, Journal of Complexity, vol.17, issue.1, pp.154-211, 2001.
DOI : 10.1006/jcom.2000.0571

L. González-vega and M. E. 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

R. Imbach, G. Moroz, and M. Pouget, Numeric certified algorithm for the topology of resultant and discriminant curves. abs/1412, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01093040

E. Kaltofen and G. Villard, On the complexity of computing determinants, computational complexity, vol.13, issue.3-4, pp.91-130, 2004.
DOI : 10.1007/s00037-004-0185-3

D. E. Knuth, The analysis of algorithms, In Congrès int. Math, vol.3, pp.269-274, 1970.

A. Kobel and M. Sagraloff, On the complexity of computing with planar algebraic curves, Journal of Complexity, vol.31, issue.2, pp.206-236, 2015.
DOI : 10.1016/j.jco.2014.08.002

R. Lebreton and É. Schost, Algorithms for the universal decomposition algebra, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.234-241, 2012.
DOI : 10.1145/2442829.2442864
URL : https://hal.archives-ouvertes.fr/hal-00669806

F. Lehobey, Resolvent computations by resultants without extraneous powers, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.85-92, 1997.
DOI : 10.1145/258726.258756

D. R. Musser, Multivariate Polynomial Factorization, Journal of the ACM, vol.22, issue.2, pp.291-308, 1975.
DOI : 10.1145/321879.321890

D. Reischert, Asymptotically fast computation of subresultants, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.233-240, 1997.
DOI : 10.1145/258726.258792

A. Schönhage, Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica, vol.1, issue.2, pp.139-144, 1971.
DOI : 10.1007/BF00289520

L. Soicher, The computation of Galois groups, 1981.