default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérémy Berthomieu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Jérémy Berthomieu
, Rafael Mohr:
Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting. ISSAC 2024: 307-315- [i12]Jérémy Berthomieu, Rafael Mohr:
Computing Generic Fibres of Polynomial Ideals with FGLM and Hensel Lifting. CoRR abs/2402.03144 (2024) - [i11]Daniela Kaufmann, Jérémy Berthomieu:
Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs. CoRR abs/2411.16348 (2024) - 2023
- [b2]Jérémy Berthomieu:
Contributions to polynomial system solving: Recurrences and Gröbner bases. Sorbonne University, Paris, France, 2023 - [j11]Jérémy Berthomieu, Stef Graillat, Dimitri Lesnoff, Théo Mary:
Modular Matrix Multiplication on GPU for Polynomial System Solving. ACM Commun. Comput. Algebra 57(2): 35-38 (2023) - 2022
- [j10]Jérémy Berthomieu, Jean-Charles Faugère:
Polynomial-division-based algorithms for computing linear recurrence relations. J. Symb. Comput. 109: 1-30 (2022) - [j9]Jérémy Berthomieu, Mohab Safey El Din:
Guessing Gröbner bases of structured ideals of relations of sequences. J. Symb. Comput. 111: 1-26 (2022) - [c6]Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din:
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions. ISSAC 2022: 409-418 - [i10]Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din:
Faster change of order algorithm for Gröbner bases under shape and stability assumptions. CoRR abs/2202.09226 (2022) - [i9]Jérémy Berthomieu, Christian Eder, Mohab Safey El Din:
New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon). CoRR abs/2202.13387 (2022) - [i8]Alin Bostan, Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din:
Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems. CoRR abs/2203.10021 (2022) - 2021
- [c5]Jérémy Berthomieu, Christian Eder, Mohab Safey El Din:
msolve: A Library for Solving Polynomial Systems. ISSAC 2021: 51-58 - [i7]Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din:
On the computation of asymptotic critical values of polynomial maps and applications. CoRR abs/2104.00913 (2021) - [i6]Jérémy Berthomieu, Christian Eder, Mohab Safey El Din:
msolve: A Library for Solving Polynomial Systems. CoRR abs/2104.03572 (2021) - [i5]Jérémy Berthomieu, Jean-Charles Faugère:
Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations. CoRR abs/2107.02582 (2021) - 2020
- [j8]Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din:
Towards fast one-block quantifier elimination through generalised critical values. ACM Commun. Comput. Algebra 54(3): 109-113 (2020) - [j7]Jérémy Berthomieu, Jean-Charles Faugère:
In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: The adaptive variants. J. Symb. Comput. 101: 270-303 (2020) - [i4]Jérémy Berthomieu, Mohab Safey El Din:
Guessing Gr{ö}bner Bases of Structured Ideals of Relations of Sequences. CoRR abs/2009.05248 (2020)
2010 – 2019
- 2018
- [c4]Jérémy Berthomieu, Jean-Charles Faugère:
A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations. ISSAC 2018: 79-86 - [i3]Jérémy Berthomieu, Jean-Charles Faugère:
In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants. CoRR abs/1806.00978 (2018) - 2017
- [j6]Jérémy Berthomieu, Brice Boyer, Jean-Charles Faugère:
Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences. J. Symb. Comput. 83: 36-67 (2017) - [i2]Jérémy Berthomieu, Jean-Charles Faugère:
In-depth comparison of the Berlekamp - Massey - Sakata and the Scalar-FGLM algorithms: the non adaptive variants. CoRR abs/1709.07168 (2017) - 2016
- [c3]Jérémy Berthomieu, Jean-Charles Faugère:
Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra. ISSAC 2016: 95-102 - 2015
- [j5]Jérémy Berthomieu, Jean-Charles Faugère, Ludovic Perret:
Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case. J. Complex. 31(4): 590-616 (2015) - [c2]Jérémy Berthomieu, Brice Boyer, Jean-Charles Faugère:
Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences. ISSAC 2015: 61-68 - 2013
- [j4]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) - [i1]Jérémy Berthomieu, Jean-Charles Faugère, Ludovic Perret:
Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials. CoRR abs/1307.4974 (2013) - 2012
- [j3]Jérémy Berthomieu, Luis Miguel Pardo:
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian. J. Complex. 28(3): 388-421 (2012) - [j2]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) - [c1]Jérémy Berthomieu, Romain Lebreton:
Relaxed p-adic Hensel lifting for algebraic systems. ISSAC 2012: 59-66 - 2011
- [b1]Jérémy Berthomieu:
Contributions à la résolution des systèmes algébriques : réduction, localisation, traitement des singularités ; implantations. (Contributions to algebraic system solving: reduction, localization, singularities handling; implementations). École Polytechnique, Palaiseau, France, 2011 - [j1]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)
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 2025-01-21 00:02 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:
