14 papers:
RTA-2015-KotsireasKS #design #equation #orthogonal #unification- Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification (ISK, TK, DES), pp. 241–256.
DAC-2014-PrussKE #abstraction #equivalence #scalability #using #verification- Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases (TP, PK, FE), p. 6.
DATE-2012-LvKE #multi #performance #reduction #verification- Efficient Gröbner basis reductions for formal verification of galois field multipliers (JL, PK, FE), pp. 899–904.
SAS-2012-CacheraJJK #imperative #invariant #polynomial #source code- Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases (DC, TPJ, AJ, FK), pp. 58–74.
TACAS-2007-CondratK #approach #preprocessor- A Gröbner Basis Approach to CNF-Formulae Preprocessing (CC, PK), pp. 618–631.
CADE-2007-Harrison #automation #proving #using- Automating Elementary Number-Theoretic Proofs Using Gröbner Bases (JH), pp. 51–66.
POPL-2004-SankaranarayananSM #generative #invariant #using- Non-linear loop invariant generation using Gröbner bases (SS, HS, ZM), pp. 318–329.
RTA-1997-GreenHK #commutative #named- Opal: A System for Computing Noncommutative Gröbner Bases (ELG, LSH, BJK), pp. 331–334.
ICALP-1996-KoppenhagenM #algorithm- Optimal Gröbner Base Algorithms for Binomial Ideals (UK, EWM), pp. 244–255.
RTA-1996-Gobel- Symideal Gröbner Bases (MG), pp. 48–62.
RTA-1993-ChakrabartiY #algorithm #correctness #distributed #memory management #on the- On the Correctness of a Distributed Memory Gröbner basis Algorithm (SC, KAY), pp. 77–91.
ICALP-1992-Buchberger- Gröbner Bases: An Introduction (BB), pp. 378–379.
STOC-1990-Lakshman #complexity #on the- On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal (YNL), pp. 555–563.
RTA-1989-Lankford #theory and practice- Generalized Gröbner Bases: Theory and Applications. A Condensation (DL), pp. 203–221.