Grégoire Lecerf

67 papers B 11C 2Journal 51Unranked 2

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