1. A. Bostan, G. Lecerf, B. Salvy, É. Schost, and B. Wiebelt, Complexity issues in bivariate polynomial factorization, in ISSAC '04: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, NY, USA, 2004, pp. 42–49.[doi]
  2. Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, and Éric Schost, Differential equations for algebraic functions, ISSAC 2007, ACM, New York, 2007, pp. 25–32.[MR/arXiv]
  3. Guillaume Chèze and Grégoire Lecerf, Lifting and recombination techniques for absolute factorization, J. Complexity 23 (2007), no. 3, 380–420.[MR]
  4. Clémence Durvye and Grégoire Lecerf, A concise proof of the Kronecker polynomial system solver from scratch, Expo. Math. 26 (2008), no. 2, 101–139.[MR]
  5. Marc Giusti, Grégoire Lecerf, and Bruno Salvy, A Gröbner free alternative for polynomial system solving, J. Complexity 17 (2001), no. 1, 154–211.[MR]
  6. G. Lecerf, Quadratic Newton iteration for systems with multiplicity, Found. Comput. Math. 2 (2002), no. 3, 247–293.[MR]
  7. Grégoire Lecerf, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, J. Complexity 19 (2003), no. 4, 564–596.[MR]
  8. Grégoire Lecerf, Fast separable factorization and applications, Appl. Algebra Engrg. Comm. Comput. 19 (2008), no. 2, 135–160.[MR]
  9. Grégoire Lecerf, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Appl. Algebra Engrg. Comm. Comput. 21 (2010), no. 2, 151–176.[MR/doi]