Ulla Koppenhagen

According to our database, Ulla Koppenhagen authored at least 6 papers between 1996 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2001

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

2000

Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups.

Ulla Koppenhagen, Ernst W. Mayr

Inf. Comput., 2000

1999

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals.

Ulla Koppenhagen, Ernst W. Mayr

J. Symb. Comput., 1999

1997

Optimal algorithms for binomial ideals and commutative semigroups.

Ulla Koppenhagen

PhD thesis, 1997

The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups.

Ulla Koppenhagen, Ernst W. Mayr

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

Optimal Gröbner Base Algorithms for Binomial Ideals.

Ulla Koppenhagen, Ernst W. Mayr

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996