Articles

type: Journal
Title	DOI	Date
A variant of Gerdt s algorithm for computing involutive bases	#	2012-07
Using Grobner bases for factoring polynomials over algebraic extension fields	#	2012-04
Efficient Computation of Castelnuovo-Mumford Regularity	#	2012-01
Erratum to A New Algorithm for Discussing Grobner Bases with Parameters J.Symbolic Comput. 33(1-2)(2002) 183-208	#	2011-10
Sharper Complexity Bounds for Zero-dimensional Grobner Bases and Polynomial System Solving	#	2011-10
Applying IsRewritten Criterion on Buchberger Algorithm	#	2011-10
A New Solution to the Relative Orientation Problem Using Only 3 Points and the Vertical Direction	#	2011-02
Computing Syzygies by Faugere s F5 Algorithm	#	2011-01
Extended F5 Criteria	#	2010-10
Strong Noether Position and Stabilized Regularities	#	2010-01

type: Conference
Title	Date
Factorization of Parametric Polynomials	2012-01
A New Efficient Algorithm for Computing SAGBI-Grobner Bases in Invariant Rings	2012-01
Detecting Unnecessary Reductions in Computing Grobner Bases over Galois Rings	2011-09
Computing Primary Decomposition of Zero-dimensional Ideals over Finite Fields	2011-09
Computing Minimal Polynomial of Parametric Matrices	2011-06
Grobner Basis Theory and Applications	2010-11
Classification of Cubic Curves by Grobner Systems	2010-11
Using Buchberger s Criteria for Computing Comprehensive Grobner Bases	2010-09
Computing Minimal Polynomial of Matrices by Grobner Bases	2010-09
A Hybrid Algorithm for Solving 7 Parameters Transformation	2009-09