Search the dblp DataBase
Ulla Koppenhagen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Ulla Koppenhagen, Ernst W. Mayr
The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. [Citation Graph (0, 0)][DBLP]
FCT, 1997, pp:257-268 [Conf] - Ulla Koppenhagen, Ernst W. Mayr
Optimal Gröbner Base Algorithms for Binomial Ideals. [Citation Graph (0, 0)][DBLP]
ICALP, 1996, pp:244-255 [Conf] - Ulla Koppenhagen, Ernst W. Mayr
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. [Citation Graph (0, 0)][DBLP]
ISSAC, 1996, pp:55-62 [Conf] - Ulla Koppenhagen, Ernst W. Mayr
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:158, n:2, pp:98-124 [Journal] - Ulla Koppenhagen, Ernst W. Mayr
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups. [Citation Graph (0, 0)][DBLP]
J. Symb. Comput., 2001, v:31, n:1/2, pp:259-276 [Journal] - Ulla Koppenhagen, Ernst W. Mayr
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. [Citation Graph (0, 0)][DBLP]
J. Symb. Comput., 1999, v:28, n:3, pp:317-338 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002