Thibaut Verron

Orcid: 0000-0003-0087-9097

According to our database1, Thibaut Verron authored at least 28 papers between 2013 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
On the computation of Gröbner bases for matrix-weighted homogeneous systems.
J. Symb. Comput., 2024

Short proofs of ideal membership.
J. Symb. Comput., 2024

Universal Analytic Gr{ö}bner Bases and Tropical Geometry.
CoRR, 2024

2023
Universal Analytic Gröbner Bases and Tropical Geometry.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Transcendence Certificates for D-finite Functions.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Signature Gröbner bases in free algebras over rings.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra.
J. Symb. Comput., 2022

On the computation of Gröbner bases for pluriweighted-homogeneous systems.
CoRR, 2022

On Polynomial Ideals and Overconvergence in Tate Algebras.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
On affine tropical F5 algorithms.
J. Symb. Comput., 2021

On Two Signature Variants of Buchberger's Algorithm over Principal Ideal Domains.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

On FGLM Algorithms with Tate Algebras.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
A Signature-Based Algorithm for Computing Gröbner Bases over Principal Ideal Domains.
Math. Comput. Sci., 2020

Signature-based algorithms for Gr{ö}bner bases over Tate algebras.
CoRR, 2020

Integral P-Recursive Sequences.
CoRR, 2020

Integral bases for p-recursive sequences.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Signature-based algorithms for Gröbner bases over tate algebras.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019
Signature-based Möller's algorithm for strong Gröbner bases over PIDs.
CoRR, 2019

Gr{ö}bner bases over Tate algebras.
CoRR, 2019

Why you should remove zeros from data before guessing.
ACM Commun. Comput. Algebra, 2019

Gröbner Bases Over Tate Algebras.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Signature-based Criteria for Möller's Algorithm for Computing Gröbner Bases over Principal Ideal Domains.
CoRR, 2018

2016
Regularisation of Gröbner basis computations for weighted and determinantal systems, and an application to medical imagery. (Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale).
PhD thesis, 2016

On the complexity of computing Gröbner bases for weighted homogeneous systems.
J. Symb. Comput., 2016

Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2014
On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems.
CoRR, 2014

2013
Computing Gröbner bases for quasi-homogeneous systems
CoRR, 2013

On the complexity of computing gröbner bases for quasi-homogeneous systems.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013


  Loading...