Grégoire Lecerf

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 27

Top Topics

Membership And Equivalence Queries

Multivariate Polynomials

Arithmetic Operations

Top Venues

ACM Commun. Comput. Algebra

Publications

Joris van der Hoeven, Grégoire Lecerf
Univariate polynomial factorization over finite fields with large extension degree. Appl. Algebra Eng. Commun. Comput. 35 (2) (2024)
Joris van der Hoeven, Grégoire Lecerf
Amortized multi-point evaluation of multivariate polynomials. J. Complex. 74 (2023)
Elena Berardini, Alain Couvreur, Grégoire Lecerf
A Proof of the Brill-Noether Method from Scratch. ACM Commun. Comput. Algebra 57 (4) (2023)
Joris van der Hoeven, Grégoire Lecerf
Fast interpolation of sparse multivariate polynomials. CoRR (2023)
Simon Abelard, Elena Berardini, Alain Couvreur, Grégoire Lecerf
Computing Riemann-Roch spaces via Puiseux expansions. J. Complex. 73 (2022)
Elena Berardini, Alain Couvreur, Grégoire Lecerf
A proof of the Brill-Noether method from scratch. CoRR (2022)
Joris van der Hoeven, Grégoire Lecerf
Fast computation of generic bivariate resultants. J. Complex. 62 (2021)
Joris van der Hoeven, Grégoire Lecerf
Fast amortized multi-point evaluation. J. Complex. 67 (2021)
Joris van der Hoeven, Grégoire Lecerf
On the Complexity Exponent of Polynomial System Solving. Found. Comput. Math. 21 (1) (2021)
Joris van der Hoeven, Grégoire Lecerf
On sparse interpolation of rational functions and gcds. ACM Commun. Comput. Algebra 55 (1) (2021)
Joris van der Hoeven, Grégoire Lecerf
Amortized Bivariate Multi-point Evaluation. ISSAC (2021)
Simon Abelard, Alain Couvreur, Grégoire Lecerf
Sub-quadratic time for riemann-roch spaces: case of smooth divisors over nodal plane projective curves. ISSAC (2020)
Joris van der Hoeven, Grégoire Lecerf
Ultimate complexity for numerical algorithms. ACM Commun. Comput. Algebra 54 (1) (2020)
Joris van der Hoeven, Grégoire Lecerf
Fast multivariate multi-point evaluation revisited. J. Complex. 56 (2020)
Joris van der Hoeven, Grégoire Lecerf
Directed evaluation. J. Complex. 60 (2020)
Grégoire Lecerf
On the complexity of the Lickteig-Roy subresultant algorithm. J. Symb. Comput. 92 (2019)
Joris van der Hoeven, Grégoire Lecerf
Accelerated tower arithmetic. J. Complex. 55 (2019)
Joris van der Hoeven, Grégoire Lecerf
Modular composition via factorization. J. Complex. 48 (2018)
Joris van der Hoeven, Robin Larrieu, Grégoire Lecerf
Implementing Fast Carryless Multiplication. MACIS (2017)
David Harvey, Joris van der Hoeven, Grégoire Lecerf
Faster Polynomial Multiplication over Finite Fields. J. ACM 63 (6) (2017)
Joris van der Hoeven, Grégoire Lecerf
Composition Modulo Powers of Polynomials. ISSAC (2017)
Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin
Modular SIMD arithmetic in Mathemagix. ACM Trans. Math. Softw. 43 (1) (2016)
David Harvey, Joris van der Hoeven, Grégoire Lecerf
Even faster integer multiplication. J. Complex. 36 (2016)
Grégoire Lecerf, Joelle Saadé
A short survey on Kantorovich: like theorems for Newton's method. ACM Commun. Comput. Algebra 50 (1) (2016)
Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf
Deterministic root finding over finite fields using Graeffe transforms. Appl. Algebra Eng. Commun. Comput. 27 (3) (2016)
David Harvey, Joris van der Hoeven, Grégoire Lecerf
. ISSAC (2016)
Joris van der Hoeven, Grégoire Lecerf
Evaluating Straight-Line Programs over Balls. ARITH (2016)
Joris van der Hoeven, Grégoire Lecerf
Faster FFTs in Medium Precision. ARITH (2015)
Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf
Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms. ISSAC (2015)
Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó
Degeneracy Loci and Polynomial Equation Solving. Found. Comput. Math. 15 (1) (2015)
Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin
Modular SIMD arithmetic in Mathemagix. CoRR (2014)
David Harvey, Joris van der Hoeven, Grégoire Lecerf
Faster polynomial multiplication over finite fields. CoRR (2014)
Joris van der Hoeven, Grégoire Lecerf
Sparse Polynomial Interpolation in Practice. ACM Commun. Comput. Algebra 48 (3/4) (2014)
David Harvey, Joris van der Hoeven, Grégoire Lecerf
Even faster integer multiplication. CoRR (2014)
Jérémy Berthomieu, Grégoire Lecerf, Guillaume Quintin
Polynomial root finding over local rings and application to error correcting codes. Appl. Algebra Eng. Commun. Comput. 24 (6) (2013)
Joris van der Hoeven, Andrey Grozin, Massimiliano Gubinelli, Grégoire Lecerf, François Poulain, Denis Raux
GNU TEXmacs: a scientific editing platform. ACM Commun. Comput. Algebra 47 (1/2) (2013)
Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó
Degeneracy loci and polynomial equation solving. CoRR (2013)
Joris van der Hoeven, Grégoire Lecerf
Interfacing mathemagix with C++. ISSAC (2013)
Joris van der Hoeven, Grégoire Lecerf
On the bit-complexity of sparse polynomial and series multiplication. J. Symb. Comput. 50 (2013)
Jérémy Berthomieu, Grégoire Lecerf
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations. Math. Comput. 81 (279) (2012)
Joris van der Hoeven, Grégoire Lecerf
On the complexity of multivariate blockwise polynomial multiplication. ISSAC (2012)
Joris van der Hoeven, Grégoire Lecerf, Bernard Mourrain, Philippe Trébuchet, Jérémy Berthomieu, Daouda Niang Diatta, Angelos Mantzaflaris
Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation? ACM Commun. Comput. Algebra 45 (3/4) (2011)
Grégoire Lecerf
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting. Appl. Algebra Eng. Commun. Comput. 21 (2) (2010)
Grégoire Lecerf
Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations. ICMS (2010)
Joris van der Hoeven, Grégoire Lecerf
On the bit-complexity of sparse polynomial multiplication CoRR (2009)
Grégoire Lecerf
Fast separable factorization and applications. Appl. Algebra Eng. Commun. Comput. 19 (2) (2008)
Marc Giusti, Grégoire Lecerf, Bruno Salvy, Jean-Claude Yakoubsohn
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One. Found. Comput. Math. 7 (1) (2007)
Guillaume Chèze, Grégoire Lecerf
Lifting and recombination techniques for absolute factorization. J. Complex. 23 (3) (2007)
Grégoire Lecerf
Improved dense multivariate polynomial factorization algorithms. J. Symb. Comput. 42 (4) (2007)
Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost
Differential equations for algebraic functions. ISSAC (2007)
Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost
Differential Equations for Algebraic Functions CoRR (2007)
Grégoire Lecerf
Sharp precision in Hensel lifting for bivariate polynomial factorization. Math. Comput. 75 (254) (2006)
Marc Giusti, Grégoire Lecerf, Bruno Salvy, Jean-Claude Yakoubsohn
On Location and Approximation of Clusters of Zeros of Analytic Functions. Found. Comput. Math. 5 (3) (2005)
Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt
Complexity issues in bivariate polynomial factorization. ISSAC (2004)
Grégoire Lecerf
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complex. 19 (4) (2003)
Alin Bostan, Grégoire Lecerf, Éric Schost
Tellegen's principle into practice. ISSAC (2003)
Grégoire Lecerf
Quadratic Newton Iteration for Systems with Multiplicity. Found. Comput. Math. 2 (3) (2002)
Marc Giusti, Grégoire Lecerf, Bruno Salvy
A Gröbner Free Alternative for Polynomial System Solving. J. Complex. 17 (1) (2001)
Grégoire Lecerf
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions. ISSAC (2000)
Marc Giusti, Klemens Hägele, Grégoire Lecerf, Joël Marchand, Bruno Salvy
The Projective Noether Maple Package: Computing the Dimension of a Projective Variety. J. Symb. Comput. 30 (3) (2000)