S. S. Abhyankar, Irreducibility criterion for germs of analytic functions of two complex variables, Advances in Math, vol.74, pp.190-257, 1989.

K. Belabas, M. Van-hoeij, J. Klüners, and A. Steel, Factoring polynomials over global fields, J. of Symb. Comp, vol.40, pp.1325-1339, 2005.
DOI : 10.5802/jtnb.655
URL : https://hal.archives-ouvertes.fr/hal-00440300

B. Bernardin and M. Monagan, Efficient Multivariate Factorization Over Finite Fields, Proceedings of AAECC '97, vol.1255, pp.15-28, 1997.
DOI : 10.1007/3-540-63163-1_2
URL : http://www.cecm.sfu.ca/~mmonagan/papers/AAECC.pdf

D. N. Bernstein, The number of roots of a system of equations, Funct. Anal. Appl, vol.9, issue.3, pp.183-185, 1975.

A. Bostan, G. Lecerf, B. Salvy, E. Schost, and B. Wiebelt, Complexity issues in bivariate polynomial factorization, Proceedings of ISSAC'04, pp.42-49, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00186759

Y. Boubakri, G. Greuel, and T. Markwig, Invariants of hypersurface singularities in positive characteristic, Revista Mat. Complutense, vol.25, pp.61-85, 2012.

J. W. Cassels and . Fields, London Math. Society Student Texts, issue.3, 1986.

P. Cassou-nogues and A. Ploski, Invariants of plane curve singularities and Newton diagrams, Univ. Iagel. Acta Math, pp.9-34, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01038045

G. Chèze and G. Lecerf, Lifting and recombination techniques for absolute factorization, J. of Complexity, vol.23, issue.3, pp.380-420, 2007.

V. Cossart and G. Moreno-socas, Irreducibility criterion: a geometric point of view, Valuation theory and its applications II, Fields Inst. Commun, vol.33, pp.27-42, 2003.

S. Gao, Factoring multivariate polynomials via partial differential equations, Math. Comp, vol.72, pp.801-822, 2003.
DOI : 10.1090/s0025-5718-02-01428-x
URL : https://www.ams.org/mcom/2003-72-242/S0025-5718-02-01428-X/S0025-5718-02-01428-X.pdf

S. Gao, Absolute Irreducibility of Polynomials via Newton polytopes, Journal of Algebra, vol.237, pp.501-520, 2001.
DOI : 10.1006/jabr.2000.8586
URL : https://doi.org/10.1006/jabr.2000.8586

S. Gao and A. G. Lauder, Decomposition of polytopes and polynomials, Discrete Comput. Geom, vol.26, pp.89-104, 2001.

S. Gao and V. M. Rodrigues, Irreducibility of polynomials modulo p via Newton Polytopes, J. Number Theory, vol.101, pp.32-47, 2003.

J. Gathen, Irreducibility of multivariate polynomials, Journal of Computer and System Sciences, vol.31, pp.225-264, 1985.

J. Gathen and J. Gerhard, Modern computer algebra, 2003.

E. Kaltofen, Polynomial factorization, Lect. Notes in Pure and Applied Math, vol.125, pp.285-309, 1982.

E. Kaltofen, Polynomial factorization, Lect. Notes Comput. Sci, vol.583, pp.294-313, 1987.

K. Kedlaya, The algebraic closure of the power series field in positive characteristic, Proc. Amer. Math. Soc, vol.129, issue.12, pp.3461-3470, 2001.

A. G. Khovanski, The index of polynomial vector field (Russian), Funkt. Anal. Prloz, vol.13, issue.1, pp.49-58, 1979.

A. G. Kouchnirenko, Polyèdres de Newton et nombres de Milnor, Inventiones math, vol.32, pp.1-31, 1976.

A. G. Kouchnirenko, Newton polytopes and the Bezout theorem, Functional analysis and its applications, pp.233-235, 1976.

T. C. Kuo, Generalized Newton-Puiseux theory and Hensel's lemma in C, Canad. J. Math, vol.41, pp.1101-1116, 1989.

G. Lecerf, Sharp precision in Hensel lifting for bivariate polynomial factorization, Math. Comp, vol.75, pp.921-933, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00186733

G. Lecerf, Fast separable factorization and applications, Applicable Algebra in Engineering, Communication and Computing, vol.19, issue.2, pp.135-160, 2008.

G. Lecerf, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Applicable Algebra in Engineering, Communication and Computing, vol.21, issue.2, pp.151-176, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00157496

H. Niederreiter, Factorization of polynomials and some linear-algebra problems over finite fields, Linear Algebra Appl, vol.192, pp.301-328, 1993.

A. Poteaux and M. Rybowicz, Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields, Proceedings of ISSAC'15, pp.299-306, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01253216

P. Philippon and M. Sombra, A refinement of the Bernstein-Kushnirenko estimate, Advances in Mathematics, vol.218, pp.1370-1418, 2008.

P. Stadelmeyer and F. Winkler, Computing the System of Adjoint Plane Curves by Puiseux Expansion, 1997.

A. Storjohann, Algorithms for matrix canonical forms, 2000.

B. Teissier, Introduction to curve singularities, Singularity theory, pp.866-893, 1991.

C. T. Wall, Singular points of plane curves, 2004.
DOI : 10.1017/cbo9780511617560

M. Weimann, A lifting and recombination algorithm for rational factorization of sparse polynomials, J. of Complexity, vol.26, issue.6, pp.608-628, 2010.
DOI : 10.1016/j.jco.2010.06.005
URL : https://hal.archives-ouvertes.fr/hal-02137320

M. Weimann, Factoring bivariate polynomials using adjoints, J. of Symb. Comp, vol.58, pp.77-98, 2013.
DOI : 10.1016/j.jsc.2013.05.011
URL : https://hal.archives-ouvertes.fr/hal-02137322