Articles

type: Journal
Title DOI Date type
Efficient Computation of Castelnuovo-Mumford Regularity # Journal
Erratum to A New Algorithm for Discussing Grobner Bases with Parameters J.Symbolic Comput. 33(1-2)(2002) 183-208 # Journal
Sharper Complexity Bounds for Zero-dimensional Grobner Bases and Polynomial System Solving # Journal
Applying IsRewritten Criterion on Buchberger Algorithm # Journal
A New Solution to the Relative Orientation Problem Using Only 3 Points and the Vertical Direction # Journal
Computing Syzygies by Faugere s F5 Algorithm # Journal
Extended F5 Criteria # Journal
Strong Noether Position and Stabilized Regularities # Journal
Nullstellensatze for Zero-dimensional Grobner Bases # Journal
Efficient Algorithms for Computing Noether Normalization # Journal
Polynomial Complexity for Hilbert Series of Borel Type Ideals # Journal
type: Conference
Title Date type
Algorithms for minimal staggered linear bases Conference
TRAVERSO'S ALGORITHM Conference
CONSTRUCTION OF GROBNER BASES IN LAURENT POLYNOMIAL RINGS Conference
On the computation of staggered linear bases Conference
Infinite free resolutions induced by Pommaret-like bases over Clements-Lindstrom rings Conference
Applying machine learning to the computation of Pommaret basesA progress report Conference
Zero-dimensional Parametric Grobner Bases Conversion Conference
Generalization of the F4 Algorithm to Parametric Polynomial Ideals Conference
Infinite Free Resolutions Induced by Pommaret-like Bases (Extended Abstract) Conference