Optimal Gröbner Base Algorithms for Binomial Ideals. - Ulla Koppenhagen; Ernst W. Mayr (ICALP, 1996)

The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. - Ulla Koppenhagen; Ernst W. Mayr (FCT, 1997)

Optimal algorithms for binomial ideals and commutative semigroups. - Ulla Koppenhagen (1997)

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. - Ulla Koppenhagen; Ernst W. Mayr (J. Symb. Comput., 1999)

Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups. - Ulla Koppenhagen; Ernst W. Mayr (Inf. Comput., 2000)

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups. - Ulla Koppenhagen; Ernst W. Mayr (J. Symb. Comput., 2001)