Articles

type: Journal
Title DOI Date
A new algorithm for Grobner bases conversion 10.1016/j.jsc.2024.102391
Machine learning parameter systems, Noether normalisations and quasi-stable positions 10.1016/j.jsc.2024.102345
A single exponential time algorithm for homogeneous regular sequence tests 10.1142/S0219498824501457
A Parametric F4 Algorithm #
Recursive Structures in Involutive Bases Theory 10.1016/j.jsc.2023.01.003
On the Complexity of Linear Algebra Operations over Algebraic Extension Fields #
A new algorithm for computing staggered linear bases 10.1016/j.jsc.2022.11.003
Complementary decompositions of monomial ideals and involutive bases 10.1007/s00200-022-00569-0
Computation of Macaulay constants and degree bounds for Grobner bases 10.1016/j.jsc.2021.11.004
type: Conference
Title Date
Algorithms for minimal staggered linear bases
TRAVERSO'S ALGORITHM
CONSTRUCTION OF GROBNER BASES IN LAURENT POLYNOMIAL RINGS
On the computation of staggered linear bases
Applying machine learning to the computation of Pommaret basesA progress report
Infinite free resolutions induced by Pommaret-like bases over Clements-Lindstrom rings
Zero-dimensional Parametric Grobner Bases Conversion
Generalization of the F4 Algorithm to Parametric Polynomial Ideals
Infinite Free Resolutions Induced by Pommaret-like Bases (Extended Abstract)
Grobner bases and their applications
Recursive Structures in Involutive Bases Theory