Ulla Koppenhagen Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2001
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlla 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
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlla 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
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlla 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
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlla Koppenhagen, Ernst W. Mayr: The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. FCT 1997: 257-268
1996
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlla Koppenhagen, Ernst W. Mayr: Optimal Gröbner Base Algorithms for Binomial Ideals. ICALP 1996: 244-255
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlla Koppenhagen, Ernst W. Mayr: An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. ISSAC 1996: 55-62

Coauthor Index

1Ernst W. Mayr [1] [2] [3] [4] [5] [6]

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)