Jérémy Berthomieu

Orcid: 0000-0002-9011-2211

According to our database1, Jérémy Berthomieu authored at least 26 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing Generic Fibres of Polynomial Ideals with FGLM and Hensel Lifting.
CoRR, 2024

Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

2023
Modular Matrix Multiplication on GPU for Polynomial System Solving.
ACM Commun. Comput. Algebra, June, 2023

Contributions to polynomial system solving: Recurrences and Gröbner bases.
, 2023

2022
Polynomial-division-based algorithms for computing linear recurrence relations.
J. Symb. Comput., 2022

Guessing Gröbner bases of structured ideals of relations of sequences.
J. Symb. Comput., 2022

Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems.
CoRR, 2022

New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon).
CoRR, 2022

Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
On the computation of asymptotic critical values of polynomial maps and applications.
CoRR, 2021

msolve: A Library for Solving Polynomial Systems.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: The adaptive variants.
J. Symb. Comput., 2020

Guessing Gr{ö}bner Bases of Structured Ideals of Relations of Sequences.
CoRR, 2020

Towards fast one-block quantifier elimination through generalised critical values.
ACM Commun. Comput. Algebra, 2020

2018
A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences.
J. Symb. Comput., 2017

In-depth comparison of the Berlekamp - Massey - Sakata and the Scalar-FGLM algorithms: the non adaptive variants.
CoRR, 2017

2016
Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case.
J. Complex., 2015

2013
Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials.
CoRR, 2013

Polynomial root finding over local rings and application to error correcting codes.
Appl. Algebra Eng. Commun. Comput., 2013

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

Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian.
J. Complex., 2012

Relaxed p-adic Hensel lifting for algebraic systems.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
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).
PhD thesis, 2011

Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation?
ACM Commun. Comput. Algebra, 2011


  Loading...