default search action
Grégoire Lecerf
- > Home > Persons > Grégoire Lecerf
Publications
- 2024
- [j37]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) - 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) - 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) - 2019
- [j26]Joris van der Hoeven, Grégoire Lecerf:
Accelerated tower arithmetic. J. Complex. 55 (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) - [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
- [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
- [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 - 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) - 2009
- [i2]Joris van der Hoeven, Grégoire Lecerf:
On the bit-complexity of sparse polynomial multiplication. CoRR abs/0901.4323 (2009)
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-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint