dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Matthias Galota Coauthor index pubzone.org

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

DBLP keys2010
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer: Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems CoRR abs/1009.1208: (2010)
2005
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Heribert Vollmer: Functions computable in polynomial space. Inf. Comput. 198(1): 56-70 (2005)
2003
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Heribert Vollmer: Functions Computable in Polynomial Space Electronic Colloquium on Computational Complexity (ECCC) 10(018): (2003)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Sven Kosub, Heribert Vollmer: Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003)
2001
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Heribert Vollmer: A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. CSL 2001: 355-368
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer: A polynomial-time approximation scheme for base station positioning in UMTS networks. DIAL-M 2001: 52-59

Coauthor Index

1Elmar Böhler [6]
2Nadia Creignou [6]
3Christian Glaßer (Christian Glasser) [1]
4Sven Kosub [3]
5Steffen Reith [1] [6]
6Henning Schnoor [6]
7Heribert Vollmer [1] [2] [3] [4] [5] [6]

Last update Wed May 30 22:34:44 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page