Articles

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