S. Abhyankar, Algebraic Geometry for Scientists and Engineers, volume 35 of Mathematical surveys and monographs, Amer. Math. Soc, 1990.

J. Bauch, E. Nart, and H. Stainsby, Abstract, LMS Journal of Computation and Mathematics, vol.55, pp.139-171, 2013.
DOI : 10.4064/aa145-1-5

A. Bostan, F. Chyzak, B. Salvy, G. Lecerf, and E. Schost, Differential equations for algebraic functions, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.25-32, 2007.
DOI : 10.1145/1277548.1277553
URL : https://hal.archives-ouvertes.fr/inria-00138206

R. P. Brent, F. G. Gustavson, and D. Y. Yun, Fast solution of toeplitz systems of equations and computation of Pad?? approximants, Journal of Algorithms, vol.1, issue.3, pp.259-295, 1980.
DOI : 10.1016/0196-6774(80)90013-9

E. Brieskorn and H. Knörrer, Plane Algebraic Curves, Birkhaüser, 1986.

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

C. Chevalley, Introduction to the Theory of Algebraic Functions of One Variable, Mathematical Surveys. AMS, vol.6, 1951.
DOI : 10.1090/surv/006

X. Dahan, E. Schost, M. M. Maza, W. Wu, and Y. Xie, On the complexity of the D5 principle, ACM SIGSAM Bulletin, vol.39, issue.3, pp.97-98, 2005.
DOI : 10.1145/1113439.1113457

J. , D. Dora, C. Dicrescenzo, and D. Duval, About a new method for computing in algebraic number fields, EUROCAL 85, 1985.

D. Duval, Diverses questions relatives au calcul formel avec des nombres algébriques, 1987.

D. Duval, Rational Puiseux expansions, Compositio Math, vol.70, issue.2, pp.119-154, 1989.

D. Duval and A. Poteaux, Death of Marc Rybowicz, aged 52, ACM Communications in Computer Algebra, vol.50, issue.4, pp.191-191, 2017.
DOI : 10.1145/3055282.3055300

M. Eichler, Introduction to the Theory of Algebraic Numbers and Functions, 1966.

J. V. Gathen and J. Gerhard, Modern Computer Algebra, 2013.

F. Kako and T. Sasaki, Solving multivariate algebraic equations by Hensel construction, Japan J. of Industrial and Applied Math, vol.16, pp.257-285, 1999.

H. T. Kung and J. F. Traub, All Algebraic Functions Can Be Computed Fast, Journal of the ACM, vol.25, issue.2, pp.245-260, 1978.
DOI : 10.1145/322063.322068
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=3139&context=compsci

G. Moroz and . Schost, A Fast Algorithm for Computing the Truncated Resultant, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '16, pp.1-8, 2016.
DOI : 10.1007/BF00289520
URL : https://hal.archives-ouvertes.fr/hal-01366386

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

B. M. Cormier, M. F. Singer, and F. Ulmer, Linear Differential Operators for Polynomial Equations, Journal of Symbolic Computation, vol.34, issue.5, pp.355-398, 2002.
DOI : 10.1006/jsco.2002.0564
URL : https://doi.org/10.1006/jsco.2002.0564

C. Pascal and E. Schost, Change of order for bivariate triangular sets, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.277-284, 2006.
DOI : 10.1145/1145768.1145814

A. Poteaux, Calcul de développements de Puiseux et application au calcul de groupe de monodromie d'une courbe algébrique plane, 2008.

A. Poteaux and M. Rybowicz, Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.239-246, 2008.
DOI : 10.1145/1390768.1390802
URL : https://hal.archives-ouvertes.fr/hal-00320600

A. Poteaux and M. Rybowicz, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, Applicable Algebra in Engineering, Communication and Computing, vol.69, issue.1???2, pp.187-217, 1007.
DOI : 10.1090/S0025-5718-00-01246-1
URL : https://hal.archives-ouvertes.fr/hal-00601438

A. Poteaux and M. Rybowicz, Good reduction of Puiseux series and applications, Journal of Symbolic Computation, vol.47, issue.1, pp.32-63, 2012.
DOI : 10.1016/j.jsc.2011.08.008
URL : https://hal.archives-ouvertes.fr/hal-00825850

A. Poteaux and M. Rybowicz, Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '15, pp.299-306, 2015.
DOI : 10.1090/S0025-5718-00-01246-1
URL : https://hal.archives-ouvertes.fr/hal-01253216

A. Poteaux and E. Schost, On the complexity of computing with zero-dimensional triangular sets, Journal of Symbolic Computation, vol.50, issue.0, pp.110-138, 2013.
DOI : 10.1016/j.jsc.2012.05.008
URL : https://hal.archives-ouvertes.fr/hal-00825847

A. Schönage and V. Strassen, Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971.
DOI : 10.1007/BF02242355

V. Shoup, Fast Construction of Irreducible Polynomials over Finite Fields, Journal of Symbolic Computation, vol.17, issue.5, pp.371-391, 1994.
DOI : 10.1006/jsco.1994.1025

R. J. Walker, Algebraic Curves, 1950.

M. Weimann, Bivariate Factorization Using a Critical Fiber, Foundations of Computational Mathematics, vol.58, issue.6, pp.1-45, 2016.
DOI : 10.1016/j.jsc.2013.05.011
URL : https://hal.archives-ouvertes.fr/hal-01645143