Prof. Dr. Heribert Vollmer

Kontaktinformationen

Prof. Dr. Heribert Vollmer
Institut für Theoretische Informatik
Fakultät für Elektrotechnik und Informatik
Universität Hannover
Appelstraße 4
30167 Hannover

Raum:	220
Telefon:	+49 511 762 19703
Fax:	+49 511 762 19606
E-Mail:	vollmer
Sprechstunde:	jederzeit nach Vereinbarung

Curriculum vitæ

riverrun, past Eve and Adam's, from swerve of shore to bend

of bay, brings us by a commodius vicus of recirculation back to

Howth Castle and Environs.

...... Far calls. Coming, far! End here. Us

then. Finn again! Take. Bussoftlhee, mememormee! Till thous-

andsthee. Lps. The keys to. Given! A way a lone a last a loved a

long the

– James Joyce, Paris, 1939.

Veröffentlichungen

2012
•	The Complexity of Reasoning for Fragments of Autoepistemic Logic Nadia Creignou, Arne Meier, Michael Thomas und Heribert Vollmer Journal ACM Transactions on Computational Logic (TOCL) 13(2):1--22 April 2012 ISSN: 1529-3785 DOI: 10.1145/2159531.2159539
•	On the Parameterized Complexity of Default Logic and Autoepistemic Logic Arne Meier, Johannes Schmidt, Michael Thomas und Heribert Vollmer Proceedings of the 6th International Conference on Language and Automata Theory and Applications. LNCS März 2012 akzeptiert
•	Counting Classes and the Fine Structure between NC¹ and L Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas und Heribert Vollmer Theoretical Computer Science 417:36--49 Februar 2012 DOI: 10.1016/j.tcs.2011.05.050
2011
•	Proof Complexity of Propositional Default Logic Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas und Heribert Vollmer Archive for Mathematical Logic 50:727-742 Juni 2011 ISSN: 0933-5846 DOI: 10.1007/s00153-011-0245-8
•	Model Checking CTL is Almost Always Inherently Sequential Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Heribert Vollmer, Thomas Schneider und Michael Thomas Logical Methods in Computer Science 7(2:12) 2011 DOI: 10.2168/LMCS-7(2:12)2011
•	The Complexity of Reasoning for Fragments of Default Logic Olaf Beyersdorff, Arne Meier, Michael Thomas und Heribert Vollmer Journal of Logic and Computation 2011 DOI: 10.1093/logcom/exq061
•	The tractability of model checking for LTL: the good, the bad, and the ugly fragments M. Bauland, M. Mundhenk, T. Schneider, H. Schnoor, I. Schnoor und H. Vollmer ACM Transactions on Computational Logic (TOCL) 12(2) 2011
•	Verifying Proofs in Constant Depth Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas und Heribert Vollmer Proceedings 36th International Symposium on Mathematical Foundations of Computer Science aus Lecutre Notes in Computer Science Herausgeber: Springer, 2011 DOI: 10.1007/978-3-642-22993-0_11 http://www.springerlink.c...g7923m7076vu/fulltext.pdf
2010
•	Complexity of Non-Monotonic Logics Michael Thomas und Heribert Vollmer Bulletin of the EATCS 102:53-82 Oktober 2010
•	Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor und Heribert Vollmer CoRR :1-24 September 2010 http://arxiv.org/abs/1009.1208v1
•	Extensional Uniformity for Boolean Circuits Pierre McKenzie, Michael Thomas und Heribert Vollmer SIAM Journal on Computing 39(7):3186-3206 2010 DOI: 10.1137/080741811
•	On Second-Order Monadic Groupoidal Quantifiers J. Kontinen und H. Vollmer Logical Methods in Computer Science 6(3:25):1-22 2010
•	The Complexity of Problems for Quantified Constraints Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith und Henning Schnoor Theory of Computing Systems 47:454-490 2010 http://www.springerlink.c...content/727w711566856102/
•	Complexity Results for Modal Dependence Logic Peter Lohmann und Heribert Vollmer Proceedings 19th Conference on Computer Science Logic, Band 6247 aus Lecture Notes in Computer Science, Seite 411--425. Herausgeber: Springer Berlin / Heidelberg, 2010 Institut für Theoretische Informatik, Leibniz Universität Hannover, Appelstr. 4, 30167 Hannover, Germany http://arxiv.org/abs/1104.0607
•	Proof Complexity of Propositional Default Logic Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas und Heribert Vollmer Proc. of the 13rd International Conference on Theory and Applications of Satisfiability Testing, Band 6175 aus Lecture Notes in Computer Science, Seite 30-43. Herausgeber: Springer, 2010 DOI: 10.1007/978-3-642-14186-7_5
2009
•	The complexity of deciding if a Boolean functions can be computed by Boolean circuits over a restricted base. H. Vollmer Theory of Computing Systems 44:82-90 2009
•	The Complexity of Generalized Satisfiability for Linear Temporal Logic M. Bauland, T. Schneider, H. Schnoor, I. Schnoor und H. Vollmer Logical Methods in Computer Science 5(1):1-21 2009
•	The Complexity of Propositional Implication Olaf Beyersdorff, Arne Meier, Michael Thomas und Heribert Vollmer Information Processing Letters 109(18):1071-1077 2009 ISSN: 0020-0190 DOI: 10.1016/j.ipl.2009.06.015
•	The Complexity of Satisfiability for Fragments of CTL and CTL* Arne Meier, Martin Mundhenk, Michael Thomas und Heribert Vollmer International Journal of Foundations of Computer Science 20(5):901-918 2009 DOI: 10.1142/S0129054109006954
•	The complexity of satisfiability problems: Refining Schaefer's theorem E. Allender, M. Bauland, N. Immerman, H. Schnoor und H. Vollmer Journal of Computer and System Sciences 75(4):245-254 2009
2008
•	Complexity of Constraints N. Creignou, P. Kolaitis und H. Vollmer Band 5250 aus Lecture Notes in Computer Science, Theoretical Computer Science and General Issues Herausgeber: Springer, 2008 http://www.springer.com/c...ce/book/978-3-540-92799-0
•	Taschenbuch der Algorithmen B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer und D. Wagner Herausgeber: Springer, 2008
•	Boolean constraint satisfaction problems: When does Post's lattice help? N. Creignou und H. Vollmer In N. Creignou, P. Kolaitis und H. Vollmer, Editor, Band 5250 aus Lecture Notes in Computer Science, Theoretical Computer Science and General Issues Seite 3-37. Herausgeber: Springer Verlag, 2008
2007
•	Computational Complexity of Constraint Satisfaction Heribert Vollmer Proceedings 3rd Conference on Computability in Europe, Band 4497 aus Lecture Notes in Computer Science, Seite 748-757. Herausgeber: Springer, 2007 DOI: 10.1007/978-3-540-73001-9_80
2006
•	Exploiting practical limitations of UML diagrams for model validation and execution Friedrich Steimann und Heribert Vollmer Software and System Modeling 5(1):26-47 2006 DOI: 10.1007/s10270-005-0097-y
•	The many faces of a translation Pierre McKenzie, Thomas Schwentick, Denis Thérien und Heribert Vollmer J. Comput. Syst. Sci. 72(1):163-179 2006 DOI: 10.1016/j.jcss.2005.08.003
2005
•	Bases for Boolean co-clones Elmar Böhler, Steffen Reith, Henning Schnoor und Heribert Vollmer Information Processing Letters 96:59-66 2005
•	Functions computable in polynomial space M. Galota und H. Vollmer Information and Computation 198(1):56-70 2005
•	The complexity of base station positioning in cellular networks C. Glaßer, S. Reith und H. Vollmer Discrete and Applied Mathematics vol. 48(1):1-12 2005
2004
•	Arithmetic circuits and polynomial replacement systems P. McKenzie, H. Vollmer und K. W. Wagner SIAM Journal on Computing 33(6):1513-1531 2004
•	First-order logic with groupoidal quantifiers H. Vollmer Collecium Logicum Vol. VI:71-105 2004
•	Playing with Boolean blocks, part II: constraint satisfaction problems E. Böhler, N. Creignou, S. Reith und H. Vollmer ACM SIGACT-Newsletter 35(1):22-35 2004
•	An algebraic approach to the complexity of generalized conjunctive queries M. Bauland, P. Chapdelaine, N. Creignou, M. Hermann und H. Vollmer Lecture Notes in Computer Science, Band 3542, Seite 30-45. Herausgeber: Springer-Verlag, 2004
•	The complexity of Boolean constraint isomorphism E. Böhler, E. Hemaspaandra, S. Reith und H. Vollmer Proc. 21st Symposium on Theoretical Aspects of Computer Science, Band 2996, Seite 164-175. 2004
2003
•	Generic separations and leaf languages M. Galota, S. Kosub und H. Vollmer Mathematical Logic Quarterly 49(4):353-362 2003
•	On the autoreducibility of random sequences; T. Ebert, W. Merkle und H. Vollmer SIAM Journal on Computing 32(6):1542-1569 2003
•	Optimal satisfiability for propositional calculi and constraint satisfaction problems H. Vollmer und S. Reith Information and Computation 186:1-19 2003
•	Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory E. Böhler, Creignou N., S. Reith und H. Vollmer ACM SIGACT-Newsletter 34(4):38-52 2003
•	Complexity theory made easy –-- the formal language approach to the definition of complexity classes H. Vollmer Proc. 7th Developments in Language Theory, Band 2710 aus Springer Lecture Notes in Computer Science, Seite 95-110. Herausgeber: Springer-Verlag, 2003
2002
•	Boolean functions and Post's lattice with applications to complexity theory E. Böhler und H. Vollmer Lecture Notes for Logic et Interaction 2002, École thématique: Complexité et Calcul Centre International de Rencontres Mathématiques 2002
•	Equivalence and isomorphism for Boolean constraint satisfaction E. Böhler, E. Hemaspaandra, S. Reith und H. Vollmer Proc. Computer Science Logic, Band 2471 aus LNCS, Seite 412-426. 2002 http://www.springer.de/comp/lncs/
•	Partially-ordered two-way automata: a new characterization of DA T. Schwentick, D. Therien und H. Vollmer Proc. 5th Developments in Language Theory, Band 2295 aus Springer Lecture Notes in Computer Science, Seite 239-250. 2002 www.springerlink.com
2001
•	Finite automata with generalized acceptance criteria T. Peichl und H. Vollmer Discrete Mathematics and Theoretical Computer Science 4:179-192 2001 http://dmtcs.loria.fr/vol...stracts/dm040210.abs.html
•	The descriptive complexity approach to LOGCFL C. Lautemann, P. McKenzie, T. Schwentick und H. Vollmer Journal of Computer and Systems Sciences 62(4):629-652 2001
•	A generalization of the Büchi-Elgot-Trakhtenbrot theorem M. Galota und H. Vollmer Proc. Computer Science Logic, Band 2142 aus Springer Lecture Notes in Computer Science, Seite 355-368. 2001 www.springerlink.com
•	A polynomial-time approximation scheme for base station positioning in UMTS networks M. Galota, C. Glaßer, S. Reith und H. Vollmer Proc. 5th Discrete Algorithms and Methods for Mobile Computing and Communications, Seite 52-59. 2001
•	Ist P = NP? Einführung in die Theorie der NP-Vollständigkeit Steffen Reith und Heribert Vollmer Technischer Bericht Dokument Nummer: 269 Fachbereich Mathematik und Informatik, Universität Würzburg, 2001
2000
•	A note on closure properties of logspace MOD classes Ulrich Hertrampf, Steffen Reith und Heribert Vollmer Inf. Process. Lett. 75(3):91-93 2000
•	Characterizing small depth and small space classes by operators of higher types M. Agrawal, E. Allender, S. Datta, H. Vollmer und K.W. Wagner Chicago Journal on Theoretical Computer Science :Article 2 2000 http://www.cs.uchicago.ed...cles/2000/2/contents.html
•	Uniform Characterizations of Complexity Classes of Functions Sven Kosub, Heinz Schmitz und Heribert Vollmer Int. J. Found. Comput. Sci. 11(4):525-551 2000
1999
•	Complements of Multivalued Functions Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf und Heribert Vollmer Chicago J. Theor. Comput. Sci. 1999 1999
•	Uniform characterizations of complexity classes Heribert Vollmer SIGACT News 30(1):17-27 1999
•	Was leistet die Komplexitätstheorie für die Praxis? Heribert Vollmer Informatik Spektrum 22(5):317-327 1999
•	Introduction to Circuit Complexity -- A Uniform Approach H. Vollmer aus Texts in Theoretical Computer Science, An EATCS Series Herausgeber: Springer-Verlag, 1999
•	Generalized quantifiers in computational complexity theory H. Vollmer Komplexität, Graphen und Automaten - Sammelband mit wissenschaftlichen Beiträgen, Gerd Wechsung zum 60. Geburtstag 1999
1998
•	Lindström Quantifiers and Leaf Language Definability Hans-Jörg Burtschick und Heribert Vollmer Int. J. Found. Comput. Sci. 9(3):277-294 1998
•	Nondeterministic NC^1 Computation Hervé Caussinus, Pierre McKenzie, Denis Thérien und Heribert Vollmer J. Comput. Syst. Sci. 57(2):200-212 1998
•	Probabilistic type-2 operators and ALMOST-classes R. V. Book, H. Vollmer und K. Wagner Computational Complexity 7:265-289 1998
•	Relating Polynomial Time to Constant Depth Heribert Vollmer Theor. Comput. Sci. 207(1):159-170 1998
•	The Chain Method to Separate Counting Classes K. Cronauer, Ulrich Hertrampf, Heribert Vollmer und Klaus W. Wagner Theory Comput. Syst. 31(1):93-108 1998
1997
•	Gap-Languages and Log-Time Complexity Classes Kenneth W. Regan und Heribert Vollmer Theor. Comput. Sci. 188(1-2):101-116 1997
•	Measure One Results in Computational Complexity Theory Heribert Vollmer und Klaus W. Wagner Advances in Algorithms, Languages, and Complexity, Seite 285-312. 1997
1996
•	On Balanced Versus Unbalanced Computation Trees Ulrich Hertrampf, Heribert Vollmer und Klaus W. Wagner Mathematical Systems Theory 29(4):411-421 1996
•	Recursion Theoretic Characterizations of Complexity Classes of Counting Functions Heribert Vollmer und Klaus W. Wagner Theor. Comput. Sci. 163(1&2):245-258 1996
•	On Type-2 Probabilistic Quantifiers Ronald V. Book, Heribert Vollmer und Klaus W. Wagner ICALP, Seite 369-380. 1996
1995
•	Complexity classes of optimization functions H. Vollmer und K. W. Wagner Information and Computation 120:198-219 1995
•	The satanic notations: counting classes beyond #P and other definitional adventures Lane A. Hemaspaandra und Heribert Vollmer SIGACT News 26(1):2-13 1995
•	On the Power of Number-Theoretic Operations with Respect to Counting Ulrich Hertrampf, Heribert Vollmer und Klaus W. Wagner Structure in Complexity Theory Conference, Seite 299-314. 1995
1994
•	On Different Reducibility Notions for Function Classes Heribert Vollmer STACS, Seite 449-460. 1994
1993
•	The Complexity of Finding Middle Elements Heribert Vollmer und Klaus W. Wagner Int. J. Found. Comput. Sci. 4(4):293-307 1993
1992
•	On the Power of Polynomial Bit-Reductions Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer und Klaus W. Wagner Universität Trier, Mathematik/Informatik, Forschungsbericht 92-28 1992
1990
•	The Gap-Language-Technique Revisited Heribert Vollmer CSL, Seite 389-399. 1990

Prof. Dr. Heribert Vollmer

Kontaktinformationen

Veröffentlichungen

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1990

Links