G. Lecerf's publication list

2007

G. Lecerf. New recombination algorithms for bivariate polynomial factorization based on Hensel lifting. Manuscript, Université de Versailles Saint-Quentin, France, 2007.
[ bib | .pdf ]

G. Lecerf. Fast separable factorization and applications. Applicable Algebra in Engineering, Communication and Computing, to appear. DOI: 10.1007/s00200-008-0062-4. The original publication is available at www.springerlink.com.
[ bib | .pdf ]

A. Bostan, F. Chyzak, G. Lecerf, B. Salvy, and E. Schost. Differential equations for algebraic functions. In Proceedings of ISSAC 2007. ACM, 2007.
[ bib | .pdf ]

2006

C. Durvye and G. Lecerf. A concise proof of the kronecker polynomial system solver from scratch. Expositiones Mathematicae. doi:10.1016/j.exmath.2007.07.001.
[ bib | .pdf ]

2005

G. Chèze and G. Lecerf. Lifting and recombination techniques for absolute factorization. Journal of Complexity, 23(3):380-420, 2007.
[ bib | .pdf ]

G. Lecerf. Improved dense multivariate polynomial factorization algorithms. Journal of Symbolic Computation, 42(4):477-494, 2007.
[ bib | .pdf ]

2004

G. Chèze and G. Lecerf. Lifting and recombination techniques for absolute factorization. Extended abstract. In Proceedings of International Conference on Polynomial System Solving. In honor of Daniel Lazard, pages 56-57, 2004.
[ bib | .pdf ]

M. Giusti, G. Lecerf, B. Salvy, and J.-C. Yakoubsohn. On location and approximation of clusters of zeros: Case of embedding dimension one. Foundations of Computational Mathematics (to appear), 7(1):1-49, 2007. The original publication is available at http://dx.doi.org/10.1007/s10208-004-0159-5 from http://www.springerlink.com.
[ bib | .pdf ]

M. Giusti, G. Lecerf, B. Salvy, and J.-C. Yakoubsohn. On location and approximation of clusters of zeros of analytic functions. Foundations of Computational Mathematics, 5(3):257-311, 2005. The original publication is available at http://dx.doi.org/10.1007/s10208-004-0144-z from http://www.springerlink.com.
[ bib | .pdf ]

G. Lecerf. Sharp precision in Hensel lifting for bivariate polynomial factorization. Mathematics of Computation, 75:921-933, 2006.
[ bib | .ps | .pdf ]

A. Bostan, G. Lecerf, B. Salvy, É. Schost, and B. Wiebelt. Complexity issues in bivariate polynomial factorization. In Proceedings of ISSAC 2004, pages 42-49. ACM, 2004.
[ bib | .ps | .pdf ]

2003

A. Bostan, G. Lecerf, and É. Schost. Tellegen's principle into practice. In Proceedings of ISSAC 2003, pages 37-44. ACM, 2003.
[ bib | .ps | .pdf ]

G. Lecerf and É. Schost. Fast multivariate power series multiplication in characteristic zero. SADIO Electronic Journal on Informatics and Operations Research, 5(1):1-10, September 2003.
[ bib | .dvi | .ps | .pdf ]

2002

G. Lecerf. Quadratic Newton iteration for systems with multiplicity. Foundations of Computational Mathematics, 2(3):247-293, 2002.
[ bib | .dvi | .ps | .pdf ]

G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. Journal of Complexity, 19(4):564-596, 2003.
[ bib | .dvi | .ps | .pdf ]

2001

M. Giusti, G. Lecerf, and B. Salvy. A Gröbner free alternative for polynomial system solving. Journal of Complexity, 17(1):154-211, 2001.
[ bib | .dvi | .ps | .pdf ]

G. Lecerf. Une alternative aux méthodes de réécriture pour la résolution des systèmes algébriques. PhD thesis, École polytechnique, 2001.
[ bib | .dvi | .ps | .pdf ]

2000

M. Giusti, K. Hägele, G. Lecerf, J. Marchand, and B. Salvy. Computing the dimension of a projective variety: the projective Noether Maple package. Journal of Symbolic Computation, 30(3):291-307, September 2000.
[ bib | .dvi | .ps | .pdf ]

G. Lecerf. Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions. In Proceedings of ISSAC'2000 (ACM), 2000.
[ bib | .dvi | .ps | .pdf ]