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.
URL : https://hal.archives-ouvertes.fr/hal-00440300

J. Berthomieu and G. Lecerf, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Math. Comp, vol.81, pp.1799-1821, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00526659

E. Brieskorn and H. Knörrer, Plane algebraic curves, 1986.

G. Chèze, Des méthodes symboliques-numériques et exactes pour la factorisation absolue des polynômes en deux variables

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

A. Couvreur, Sums of residues on algebraic surfaces and applications to coding theory, J. of Pure and Applied Algebra, vol.213, pp.2201-2223, 2009.

B. Deconinck and M. Van-hoeij, Computing Riemann matrices of algebraic curves, PhysicaD, vol.152, pp.28-46, 2001.

D. Duval, Absolute factorization of polynomials, a geometric approach, SIAM J. Comput, vol.20, issue.1, pp.1-21, 1991.

W. Fulton, Adjoints and Max Noether's Fundamentalsatz, Algebra, arithmetic and geometry with applications, pp.301-313, 2004.
DOI : 10.1007/978-3-642-18487-1_19

URL : http://arxiv.org/pdf/math/0209203v1.pdf

J. Zur-gathen and J. Gerhard, Modern computer algebra, 2003.

D. Gorenstein, An arithmetic theory of adjoint plane curves, Trans. Amer. Math. Soc, vol.72, pp.414-436, 1952.

R. Hartshorne, Algebraic geometry, 1977.

R. Hartshorne, Residues and Duality, vol.20, 1989.
DOI : 10.1007/bfb0080482

J. Kollár, Lectures on resolution of singularities, Ann. Math. Studies, vol.166, 2007.

D. Lazard and R. Rioboo, Integration of rational functions: rational computation of the logarithmic part, J. Symbolic Comput, vol.9, pp.113-115, 1990.

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.

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

J. Lipman, Residues, Duality, Fundamental Class, Notes for Algecom, vol.4, 2011.

. Liu, Algebraic Geometry and Arithmetic Curves, Oxford Graduate Texts in Mathematics, vol.6, 2002.

M. Mn?ukmn?uk, An Algebraic Approach to Computing Adjoint Curves, J. Symbolic Computation, vol.23, pp.229-240, 1997.

A. Poteaux and M. , Rybowicz Complexity Bounds for the rational Newton-Puiseux Algorithm over Finite Fields, Appl. Alg. in Eng., Comm. and Comp, vol.22, pp.187-217, 2011.

J. Ragot, Sur la factorisation absolue des polynômes, 1997.

J. Serre, Algebraic Groups and class fields, Graduate texts in Mathematics, vol.117, 1988.

L. Szpiro, Lectures on equations defining space curves, 1979.

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

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

. Tate, Residues of differentials on curves, Annales scientifiques de l'E.N.S. 4e série, vol.1, pp.149-159, 1968.

R. Vakil, An algebraic proof of Riemann-Roch

M. Van-hoeij, An algorithm for computing an integral basis in an algebraic function field, J. Symb. Comput, vol.18, pp.353-363, 1994.

C. T. Wall, Singular points of plane curves, 2004.

M. Weimann, Algebraic osculation and factorization of sparse polynomials
URL : https://hal.archives-ouvertes.fr/hal-02137318

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