 | 2001 |
|---|
| 6 |       | Ulla Koppenhagen,
Ernst W. Mayr:
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups.
J. Symb. Comput. 31(1/2): 259-276 (2001) |
| 2000 |
|---|
| 5 | | Ulla Koppenhagen,
Ernst W. Mayr:
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups.
Inf. Comput. 158(2): 98-124 (2000) |
| 1999 |
|---|
| 4 | | Ulla Koppenhagen,
Ernst W. Mayr:
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals.
J. Symb. Comput. 28(3): 317-338 (1999) |
| 1997 |
|---|
| 3 | | Ulla Koppenhagen,
Ernst W. Mayr:
The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups.
FCT 1997: 257-268 |
| 1996 |
|---|
| 2 |  | Ulla Koppenhagen,
Ernst W. Mayr:
Optimal Gröbner Base Algorithms for Binomial Ideals.
ICALP 1996: 244-255 |
| 1 | | Ulla Koppenhagen,
Ernst W. Mayr:
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals.
ISSAC 1996: 55-62 |
