default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrégoire Lecerf
Person information
- affiliation: Versailles Saint-Quentin-en-Yvelines University, Mathematics Laboratory
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Joris van der Hoeven
, Grégoire Lecerf:
Univariate polynomial factorization over finite fields with large extension degree. Appl. Algebra Eng. Commun. Comput. 35(2): 121-149 (2024)- [j37]Simon Abelard, Alain Couvreur, Grégoire Lecerf:
Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities. Appl. Algebra Eng. Commun. Comput. 35(6): 739-804 (2024) - 2023
- [j36]Elena Berardini, Alain Couvreur, Grégoire Lecerf:
A Proof of the Brill-Noether Method from Scratch. ACM Commun. Comput. Algebra 57(4): 200-229 (2023) - [j35]Joris van der Hoeven, Grégoire Lecerf:
Amortized multi-point evaluation of multivariate polynomials. J. Complex. 74: 101693 (2023) - [i8]Joris van der Hoeven, Grégoire Lecerf:
Fast interpolation of sparse multivariate polynomials. CoRR abs/2312.17664 (2023) - 2022
- [j34]Simon Abelard, Elena Berardini, Alain Couvreur, Grégoire Lecerf:
Computing Riemann-Roch spaces via Puiseux expansions. J. Complex. 73: 101666 (2022) - [i7]Elena Berardini, Alain Couvreur, Grégoire Lecerf:
A proof of the Brill-Noether method from scratch. CoRR abs/2208.12725 (2022) - 2021
- [j33]Joris van der Hoeven, Grégoire Lecerf:
On sparse interpolation of rational functions and gcds. ACM Commun. Comput. Algebra 55(1): 1-12 (2021) - [j32]Joris van der Hoeven, Grégoire Lecerf:
On the Complexity Exponent of Polynomial System Solving. Found. Comput. Math. 21(1): 1-57 (2021) - [j31]Joris van der Hoeven, Grégoire Lecerf:
Fast computation of generic bivariate resultants. J. Complex. 62: 101499 (2021) - [j30]Joris van der Hoeven, Grégoire Lecerf:
Fast amortized multi-point evaluation. J. Complex. 67: 101574 (2021) - [c15]Joris van der Hoeven, Grégoire Lecerf:
Amortized Bivariate Multi-point Evaluation. ISSAC 2021: 179-185 - 2020
- [j29]Joris van der Hoeven, Grégoire Lecerf:
Ultimate complexity for numerical algorithms. ACM Commun. Comput. Algebra 54(1): 1-13 (2020) - [j28]Joris van der Hoeven, Grégoire Lecerf:
Fast multivariate multi-point evaluation revisited. J. Complex. 56 (2020) - [j27]Joris van der Hoeven, Grégoire Lecerf:
Directed evaluation. J. Complex. 60: 101498 (2020) - [c14]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: 14-21
2010 – 2019
- 2019
- [j26]Joris van der Hoeven, Grégoire Lecerf:
Accelerated tower arithmetic. J. Complex. 55 (2019) - [j25]Grégoire Lecerf:
On the complexity of the Lickteig-Roy subresultant algorithm. J. Symb. Comput. 92: 243-268 (2019) - 2018
- [j24]Joris van der Hoeven, Grégoire Lecerf:
Modular composition via factorization. J. Complex. 48: 36-68 (2018) - 2017
- [j23]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Faster Polynomial Multiplication over Finite Fields. J. ACM 63(6): 52:1-52:23 (2017) - [c13]Joris van der Hoeven, Grégoire Lecerf:
Composition Modulo Powers of Polynomials. ISSAC 2017: 445-452 - [c12]Joris van der Hoeven, Robin Larrieu, Grégoire Lecerf:
Implementing Fast Carryless Multiplication. MACIS 2017: 121-136 - 2016
- [j22]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): 237-257 (2016) - [j21]Grégoire Lecerf, Joelle Saadé:
A short survey on Kantorovich: like theorems for Newton's method. ACM Commun. Comput. Algebra 50(1): 1-11 (2016) - [j20]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Even faster integer multiplication. J. Complex. 36: 1-30 (2016) - [j19]Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin:
Modular SIMD arithmetic in Mathemagix. ACM Trans. Math. Softw. 43(1): 5:1-5:37 (2016) - [c11]Joris van der Hoeven, Grégoire Lecerf:
Evaluating Straight-Line Programs over Balls. ARITH 2016: 142-149 - [c10]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Fast Polynomial Multiplication over F260. ISSAC 2016: 255-262 - 2015
- [j18]Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó:
Degeneracy Loci and Polynomial Equation Solving. Found. Comput. Math. 15(1): 159-184 (2015) - [c9]Joris van der Hoeven, Grégoire Lecerf:
Faster FFTs in Medium Precision. ARITH 2015: 75-82 - [c8]Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf:
Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms. ISSAC 2015: 197-204 - 2014
- [j17]Joris van der Hoeven, Grégoire Lecerf:
Sparse Polynomial Interpolation in Practice. ACM Commun. Comput. Algebra 48(3/4): 187-191 (2014) - [i6]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Even faster integer multiplication. CoRR abs/1407.3360 (2014) - [i5]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Faster polynomial multiplication over finite fields. CoRR abs/1407.3361 (2014) - [i4]Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin:
Modular SIMD arithmetic in Mathemagix. CoRR abs/1407.3383 (2014) - 2013
- [j16]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): 413-443 (2013) - [j15]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): 59-61 (2013) - [j14]Joris van der Hoeven, Grégoire Lecerf:
On the bit-complexity of sparse polynomial and series multiplication. J. Symb. Comput. 50: 227-254 (2013) - [c7]Joris van der Hoeven, Grégoire Lecerf:
Interfacing mathemagix with C++. ISSAC 2013: 363-370 - [p1]Erich L. Kaltofen, Grégoire Lecerf:
Factorization of multivariate polynomials. Handbook of Finite Fields 2013: 382-392 - [i3]Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó:
Degeneracy loci and polynomial equation solving. CoRR abs/1306.3390 (2013) - 2012
- [j13]Jérémy Berthomieu, Grégoire Lecerf:
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations. Math. Comput. 81(279): 1799-1821 (2012) - [c6]Joris van der Hoeven, Grégoire Lecerf:
On the complexity of multivariate blockwise polynomial multiplication. ISSAC 2012: 211-218 - 2011
- [j12]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): 186-188 (2011) - 2010
- [j11]Grégoire Lecerf:
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting. Appl. Algebra Eng. Commun. Comput. 21(2): 151-176 (2010) - [c5]Grégoire Lecerf:
Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations. ICMS 2010: 329-332
2000 – 2009
- 2009
- [i2]Joris van der Hoeven, Grégoire Lecerf:
On the bit-complexity of sparse polynomial multiplication. CoRR abs/0901.4323 (2009) - 2008
- [j10]Grégoire Lecerf:
Fast separable factorization and applications. Appl. Algebra Eng. Commun. Comput. 19(2): 135-160 (2008) - 2007
- [j9]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): 1-58 (2007) - [j8]Guillaume Chèze, Grégoire Lecerf:
Lifting and recombination techniques for absolute factorization. J. Complex. 23(3): 380-420 (2007) - [j7]Grégoire Lecerf:
Improved dense multivariate polynomial factorization algorithms. J. Symb. Comput. 42(4): 477-494 (2007) - [c4]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost:
Differential equations for algebraic functions. ISSAC 2007: 25-32 - [i1]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost:
Differential Equations for Algebraic Functions. CoRR abs/cs/0703121 (2007) - 2006
- [j6]Grégoire Lecerf:
Sharp precision in Hensel lifting for bivariate polynomial factorization. Math. Comput. 75(254): 921-933 (2006) - 2005
- [j5]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): 257-311 (2005) - 2004
- [c3]Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt:
Complexity issues in bivariate polynomial factorization. ISSAC 2004: 42-49 - 2003
- [j4]Grégoire Lecerf:
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complex. 19(4): 564-596 (2003) - [c2]Alin Bostan, Grégoire Lecerf, Éric Schost:
Tellegen's principle into practice. ISSAC 2003: 37-44 - 2002
- [j3]Grégoire Lecerf:
Quadratic Newton Iteration for Systems with Multiplicity. Found. Comput. Math. 2(3): 247-293 (2002) - 2001
- [j2]Marc Giusti, Grégoire Lecerf, Bruno Salvy:
A Gröbner Free Alternative for Polynomial System Solving. J. Complex. 17(1): 154-211 (2001) - 2000
- [j1]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): 291-307 (2000) - [c1]Grégoire Lecerf:
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions. ISSAC 2000: 209-216
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
