Articles

type: Journal
Title DOI Date Conference / journal
Minimal Staggered Linear Bases and Their Applications Mathematics in Computer Science
On Saturation of Zero-Dimensional Ideals EXPERIMENTAL MATHEMATICS
Computing finite and infinite free resolutions with Pommaret-like bases 10.1016/j.jsc.2025.102454 JOURNAL OF SYMBOLIC COMPUTATION
A new algorithm for Grobner bases conversion 10.1016/j.jsc.2024.102391 JOURNAL OF SYMBOLIC COMPUTATION
Machine learning parameter systems, Noether normalisations and quasi-stable positions 10.1016/j.jsc.2024.102345 JOURNAL OF SYMBOLIC COMPUTATION
A Parametric F4 Algorithm Iranian Journal of Mathematical Sciences and Informatics
A single exponential time algorithm for homogeneous regular sequence tests 10.1142/S0219498824501457 JOURNAL OF ALGEBRA AND ITS APPLICATIONS
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
type: Conference
Title Date
Algorithms for minimal staggered linear bases
CONSTRUCTION OF GROBNER BASES IN LAURENT POLYNOMIAL RINGS
TRAVERSO'S ALGORITHM
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)