Non-commutative Gröbner bases in algebras of solvable type

The diamond lemma for ring theory

George M. Bergman · Advances in Mathematics · 1978 · 1.2K citations

Natural Sciences, Mathematics, Algebra +5

Greobner Bases : an algorithmic method in polynomial ideal theory

Bruno Buchberger · Medical Entomology and Zoology · 1985 · 1.1K citations

Natural Sciences, Computer Science, Mathematics +11

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Gérard Huet · Journal of the ACM · 1980 · 1.1K citations · Full text

Language Studies, Information Systems, Computational Linguistics +7

Theory of Non-Commutative Polynomials

Öystein Ore · Annals of Mathematics · 1933 · 801 citations

Natural Sciences, Mathematics, Physics +8

The complexity of the word problems for commutative semigroups and polynomial ideals

Ernst Mayr, Albert R. Meyer · Advances in Mathematics · 1982 · 506 citations · Full text

Computing, Computer Science, Mathematics +16