Upper and Lower Bounds for the Degree of Groebner Bases

History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation

The Gröbner fan of an ideal

Journal of Symbolic Computation

A new lower bound construction for commutative thue systems with applications

Journal of Symbolic Computation

Nonexistence of degree bounds of various bases for ideals of polynomials over the integers

ACM SIGSAM Bulletin

Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals

ACM Transactions on Mathematical Software (TOMS)

An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation

Exponential space computation of Gröbner bases

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation

On the Gröbner bases of some symmetric systems and their application to coding theory

Journal of Symbolic Computation

Modular algorithms for computing Gröbner bases

Journal of Symbolic Computation

Cited References

Computer algebra handbook

Path gain algebraic formulation for the scalar linear network coding problem

IEEE Transactions on Information Theory

Dimension-dependent bounds for Gröbner bases of polynomial ideals

Journal of Symbolic Computation