Grégoire Lecerf

According to our database, Grégoire Lecerf authored at least 56 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities.

Simon Abelard, Alain Couvreur, Grégoire Lecerf

Appl. Algebra Eng. Commun. Comput., November, 2024

Univariate polynomial factorization over finite fields with large extension degree.

Joris van der Hoeven, Grégoire Lecerf

Appl. Algebra Eng. Commun. Comput., 2024

2023

A Proof of the Brill-Noether Method from Scratch.

Elena Berardini, Alain Couvreur, Grégoire Lecerf

ACM Commun. Comput. Algebra, December, 2023

Amortized multi-point evaluation of multivariate polynomials.

Joris van der Hoeven, Grégoire Lecerf

J. Complex., 2023

Fast interpolation of sparse multivariate polynomials.

Joris van der Hoeven, Grégoire Lecerf

CoRR, 2023

2022

Computing Riemann-Roch spaces via Puiseux expansions.

Simon Abelard, Elena Berardini, Alain Couvreur, Grégoire Lecerf

J. Complex., 2022

2021

Fast amortized multi-point evaluation.

Joris van der Hoeven, Grégoire Lecerf

J. Complex., 2021

Fast computation of generic bivariate resultants.

Joris van der Hoeven, Grégoire Lecerf

J. Complex., 2021

On the Complexity Exponent of Polynomial System Solving.

Joris van der Hoeven, Grégoire Lecerf

Found. Comput. Math., 2021

On sparse interpolation of rational functions and gcds.

Joris van der Hoeven, Grégoire Lecerf

ACM Commun. Comput. Algebra, 2021

Amortized Bivariate Multi-point Evaluation.

Joris van der Hoeven, Grégoire Lecerf

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

Directed evaluation.

Joris van der Hoeven, Grégoire Lecerf

J. Complex., 2020

Fast multivariate multi-point evaluation revisited.

Joris van der Hoeven, Grégoire Lecerf

J. Complex., 2020

Ultimate complexity for numerical algorithms.

Joris van der Hoeven, Grégoire Lecerf

ACM Commun. Comput. Algebra, 2020

Sub-quadratic time for riemann-roch spaces: case of smooth divisors over nodal plane projective curves.

Simon Abelard, Alain Couvreur, Grégoire Lecerf

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

On the complexity of the Lickteig-Roy subresultant algorithm.

Grégoire Lecerf

J. Symb. Comput., 2019

Accelerated tower arithmetic.

Joris van der Hoeven, Grégoire Lecerf

J. Complex., 2019

2018

Modular composition via factorization.

Joris van der Hoeven, Grégoire Lecerf

J. Complex., 2018

2017

Faster Polynomial Multiplication over Finite Fields.

David Harvey, Joris van der Hoeven, Grégoire Lecerf

J. ACM, 2017

Implementing Fast Carryless Multiplication.

Joris van der Hoeven, Robin Larrieu, Grégoire Lecerf

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Composition Modulo Powers of Polynomials.

Joris van der Hoeven, Grégoire Lecerf

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016

Modular SIMD arithmetic in Mathemagix.

Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin

ACM Trans. Math. Softw., 2016

Even faster integer multiplication.

David Harvey, Joris van der Hoeven, Grégoire Lecerf

J. Complex., 2016

A short survey on Kantorovich: like theorems for Newton's method.

Grégoire Lecerf, Joelle Saadé

ACM Commun. Comput. Algebra, 2016

Deterministic root finding over finite fields using Graeffe transforms.

Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf

Appl. Algebra Eng. Commun. Comput., 2016

Fast Polynomial Multiplication over F₂₆₀.

David Harvey, Joris van der Hoeven, Grégoire Lecerf

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Evaluating Straight-Line Programs over Balls.

Joris van der Hoeven, Grégoire Lecerf

Proceedings of the 23nd IEEE Symposium on Computer Arithmetic, 2016

2015

Degeneracy Loci and Polynomial Equation Solving.

Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó

Found. Comput. Math., 2015

Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms.

Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Faster FFTs in Medium Precision.

Joris van der Hoeven, Grégoire Lecerf

Proceedings of the 22nd IEEE Symposium on Computer Arithmetic, 2015

2014

Sparse Polynomial Interpolation in Practice.

Joris van der Hoeven, Grégoire Lecerf

ACM Commun. Comput. Algebra, 2014

2013

On the bit-complexity of sparse polynomial and series multiplication.

Joris van der Hoeven, Grégoire Lecerf

J. Symb. Comput., 2013

GNU TEXmacs: a scientific editing platform.

Joris van der Hoeven, Andrey Grozin, Massimiliano Gubinelli, Grégoire Lecerf, François Poulain, Denis Raux

ACM Commun. Comput. Algebra, 2013

Polynomial root finding over local rings and application to error correcting codes.

Jérémy Berthomieu, Grégoire Lecerf, Guillaume Quintin

Appl. Algebra Eng. Commun. Comput., 2013

Interfacing mathemagix with C++.

Joris van der Hoeven, Grégoire Lecerf

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Factorization of multivariate polynomials.

Erich L. Kaltofen, Grégoire Lecerf

Proceedings of the Handbook of Finite Fields., 2013

2012

Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations.

Jérémy Berthomieu, Grégoire Lecerf

Math. Comput., 2012

On the complexity of multivariate blockwise polynomial multiplication.

Joris van der Hoeven, Grégoire Lecerf

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation?

Joris van der Hoeven, Grégoire Lecerf, Bernard Mourrain, Philippe Trébuchet, Jérémy Berthomieu, Daouda Niang Diatta, Angelos Mantzaflaris

ACM Commun. Comput. Algebra, 2011

2010

New recombination algorithms for bivariate polynomial factorization based on Hensel lifting.

Grégoire Lecerf

Appl. Algebra Eng. Commun. Comput., 2010

Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations.

Grégoire Lecerf

Proceedings of the Mathematical Software, 2010

2009

On the bit-complexity of sparse polynomial multiplication

Joris van der Hoeven, Grégoire Lecerf

CoRR, 2009

2008

Fast separable factorization and applications.

Grégoire Lecerf

Appl. Algebra Eng. Commun. Comput., 2008

2007

Improved dense multivariate polynomial factorization algorithms.

Grégoire Lecerf

J. Symb. Comput., 2007

Lifting and recombination techniques for absolute factorization.

Guillaume Chèze, Grégoire Lecerf

J. Complex., 2007

On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One.

Marc Giusti, Grégoire Lecerf, Bruno Salvy, Jean-Claude Yakoubsohn

Found. Comput. Math., 2007

Differential equations for algebraic functions.

Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

Sharp precision in Hensel lifting for bivariate polynomial factorization.

Grégoire Lecerf

Math. Comput., 2006

2005

On Location and Approximation of Clusters of Zeros of Analytic Functions.

Marc Giusti, Grégoire Lecerf, Bruno Salvy, Jean-Claude Yakoubsohn

Found. Comput. Math., 2005

2004

Complexity issues in bivariate polynomial factorization.

Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers.

Grégoire Lecerf

J. Complex., 2003

Tellegen's principle into practice.

Alin Bostan, Grégoire Lecerf, Éric Schost

Proceedings of the Symbolic and Algebraic Computation, 2003

2002

Quadratic Newton Iteration for Systems with Multiplicity.

Grégoire Lecerf

Found. Comput. Math., 2002

2001

A Gröbner Free Alternative for Polynomial System Solving.

Marc Giusti, Grégoire Lecerf, Bruno Salvy

J. Complex., 2001

2000

The Projective Noether Maple Package: Computing the Dimension of a Projective Variety.

Marc Giusti, Klemens Hägele, Grégoire Lecerf, Joël Marchand, Bruno Salvy

J. Symb. Comput., 2000

Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions.

Grégoire Lecerf

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000