Publikationen

2013
•	Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice Julian-Steffen Müller und Heribert Vollmer Leibniz Universität Hannover, März 2013 akzeptiert http://arxiv.org/abs/1303.6424
•	Generalized satisfiability for the description logic ALC Arne Meier und Thomas Schneider Theoretical Computer Science 2013 http://dx.doi.org/10.1016/j.tcs.2013.02.009
•	Extended Modal Dependence Logic EMDL Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema und Heribert Vollmer WoLLIC 2013 2013 akzeptiert
2012
•	A Fragment of Dependence Logic Capturing Polynomial Time Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller und Heribert Vollmer Leibniz Universität Hannover, University of Helsinki, Oktober 2012 eingereicht http://arxiv.org/abs/1210.3321
•	Generalized Complexity of ALC Subsumption Arne Meier Proc. 10th International Workshop on Boolean Problems September 2012
•	Complexity of Model Checking for Logics over Kripke models Arne Meier, Julian-Steffen Müller, Martin Mundhenk und Heribert Vollmer Bulletin of the EATCS 108:49-89 August 2012
•	LoCo - A Logic for Configuration Problems Markus Aschinger, Conrad Drescher und Heribert Vollmer ECAI Band 242 aus Frontiers in Artificial Intelligence and Applications Herausgeber: IOS Press, August 2012 ISBN: 978-1-61499-097-0 http://www.booksonline.io...tent/View.aspx?piid=31572 http://dx.doi.org/10.3233/978-1-61499-098-7-73
•	The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas und Felix Weiss Proc. AIML'2012 August 2012 Bemerkung: A preliminary version appeared: The Complexity of Satisfiability for Fragments of Hybrid Logic - Part II, International Workshop on Hybrid Logic and Applications 2010
•	Complexity of Model Checking in Modal Team Logic Julian-Steffen Müller Computation in Europe (CiE) 2012 Juni 2012
•	Parameterized Complexity of Weighted Satisfiability Problems Nadia Creignou und Heribert Vollmer In Roberto Sebastiani Alessandro Cimatti, Editor, Theory and Applications of Satisfiability Testing aus Lecture Notes in Computer Science / Theoretical Computer Science and General Issues , Seite 341-354. Herausgeber: Springer, Juni 2012 ISBN: 978-3-642-31611-1
•	On the Applicability of Post's Lattice Michael Thomas Information Processing Letters 112(10):386â€“391 Mai 2012 DOI: 10.1016/j.ipl.2012.02.002
•	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 Bemerkung: A preliminary version appeared in: Dagstuhl Seminar Proceedings, Vol. 10061 in Circuits, Logic, and Games, http://drops.dagstuhl.de/opus/volltexte/2010/2523, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010.
•	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 Band 7183 , Seite 389-400. März 2012 DOI: 10.1007/978-3-642-28332-1_33
•	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 Bemerkung: A preliminary version appeared in: Proc. 35th International Symposium on Mathematical Foundations of Computer Science, Volume 6281 of Lecture Notes in Computer Science, pp. 306-317, 2010.
•	The Complexity of Circumscriptive Inference in Post's Lattice Michael Thomas Theory of Computing Systems 50(3):401--419 2012 DOI: 10.1007/s00224-010-9311-6 Bemerkung: A preliminary version appeared in: Proc. 10th International Conference on Logic Programming and Nonmonotonic Reasoning, Vol. 5753 of Lecture Notes in Computer Science, pp. 290-302, Springer, 2009.
2011
•	On the Complexity of Modal Logic Variants and their Fragments Arne Meier Leibniz Universität Hannover, November 2011 ISBN: 3869559292
•	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 Bemerkung: A preliminary version appeared in: Proc. of the 13rd International Conference on Theory and Applications of Satisfiability Testing, Band 6175 aus Lecture Notes in Computer Science, Seite 30-43, Springer, 2010.
•	Complexity of Model Checking for Modal Dependence Logic Johannes Ebbing und Peter Lohmann CoRR 1104.1034:1-21 2011 http://arxiv.org/abs/1104.1034
•	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 Bemerkung: A preliminary version appeared in: Proc. of the 16th International Symposium on Temporal Representation and Reasoning, IEEE Computer Society Press, 2009.
•	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 Bemerkung: A preliminary version appeared in: Proc. 12th International Conference on Theory and Applications of Satisfiability Testing, Vol. 5584 of Lecture Notes in Computer Science, pp. 51-64, Springer, 2009.
•	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 Bemerkung: Tentative. A preliminary version appeared in: Vol. 231 of ScienceDirect Electronic Notes in Theoretical Computer Science (ENTCS), pp. 277-292, 2009.
•	Algorithms Unplugged Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer und Dorothea Wagner Herausgeber: Springer, 2011
•	Generalized Satisfiability for the Description Logic ALC Arne Meier und Thomas Schneider Proceedings of the 8th Annual Conference on Theory and Application of Models of Computation, LNCS 6648 , Seite 552-562. 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
•	Abstraction for Model Checking Modular Interpreted Systems over ATL Michael Köster und Peter Lohmann 9th International Workshop on Programming Multi-Agent Systems 2011 2011 akzeptiert Bemerkung: to appear
•	Complexity of two-variable Dependence Logic and IF-Logic Juha Kontinen, Antti Kuusisto, Peter Lohmann und Jonni Virtema Logic in Computer Science (LICS 2011) 2011 akzeptiert http://arxiv.org/abs/1104.3148 Bemerkung: to appear
2010
•	The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber und Felix Weiss Journal of Applied Logic 8(4):409-421 Dezember 2010 DOI: 10.1016/j.jal.2010.08.001 Bemerkung: A preliminary version appeared in: Proc. 34th International Symposium on Mathematical Foundations of Computer Science, Vol. 5754 of Springer Lecture Notes in Computer Science, pp. 587-599, 2009.
•	On the Complexity of Fragments of Nonmonotonic Logics Michael Thomas Leibniz Universität Hannover, November 2010 ISBN: 978-3-86955-571-3
•	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
•	A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games Olaf Beyersdorff, Nicola Galesi und Massimo Lauria Information Processing Letters 110(23):1074--1077 2010
•	A Tight Karp-Lipton Collapse Result in Bounded Arithmetic Olaf Beyersdorff und Sebastian Müller ACM Transactions on Computational Logic 11(4) 2010 Bemerkung: A preliminary version appeared in the Proc. of CSL'08.
•	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 Bemerkung: A preliminary version appeared in: Proc. 22th Conference on Computer Science Logic, Vol. 5213 of Springer Lecture Notes in Computer Science, pp. 64-78, 2008.
•	On Second-Order Monadic Groupoidal Quantifiers J. Kontinen und H. Vollmer Logical Methods in Computer Science 6(3:25):1-22 2010 Bemerkung: Preliminary Version appeared in Proc. Workshop on Logic, Language, Information and Computation 2008
•	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/
•	The deduction theorem for strong propositional proof systems Olaf Beyersdorff Theory of Computing Systems 47(1):162--178 2010 Bemerkung: A preliminary version appeared in the Proc. of FSTTCS'07.
•	Complexity of Propositional Abduction for Restricted Sets of Boolean Functions Nadia Creignou, Johannes Schmidt und Michael Thomas Proc. 12th International Conference on the Principles of Knowledge Representation and Reasoning, Seite 8-16. Herausgeber: AAAI Press, 2010 http://aaai.org/ocs/index...KR/KR2010/paper/view/1201 Bemerkung: To appear in JLC.
•	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
•	Different Approaches to Proof Systems Olaf Beyersdorff und Sebastian Müller Proc. 7th Conference on Theory and Applications of Models of Computation, Band 6108 aus Lecture Notes in Computer Science, Seite 50--59. Herausgeber: Springer-Verlag, Berlin Heidelberg, 2010
•	Proof Complexity of Non-classical Logics Olaf Beyersdorff Proc. 7th Conference on Theory and Applications of Models of Computation, Band 6108 aus Lecture Notes in Computer Science, Seite 15--27. Herausgeber: Springer-Verlag, Berlin Heidelberg, 2010
•	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 Bemerkung: Also appeared in: Circuits, Logic, and Games, Vol. 10061 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010.
•	Sets of Boolean Connectives that Make Argumentation Easier Nadia Creignou, Johannes Schmidt, Michael Thomas und Stefan Woltran Proc. 12th European Conference on Logics in Artificial Intelligence, Band 6341 aus Lecture Notes in Computer Science, Seite 117-129. Herausgeber: Springer, 2010 Bemerkung: To appear in: Argument and Computation
•	The Complexity of Satisfiability for Sub-Boolean Fragments of ALC Arne Meier und Thomas Schneider In V. Haarslev, D. Toman und G. Weddell, Editor, Proc. of the 23rd International Workshop on Description Logics (DL 2010), Band 573, Seite 279--290. Waterloo, Canada 2010
•	The Complexity of Satisfiability for Sub-Boolean Fragments of ALC Arne Meier und Thomas Schneider Technical Report Institut für Theoretische Informatik, Leibniz Universität Hannover, 2010
2009
•	Comparing axiomatizations of free pseudospaces Olaf Beyersdorff Archive for Mathematical Logic 48(7):625--641 2009
•	Nondeterministic functions and the existence of optimal proof systems Olaf Beyersdorff, Johannes Köbler und Jochen Messner Theoretical Computer Science 410(38--40):3839--3855 2009
•	On the Correspondence Between Arithmetic Theories and Propositional Proof Systems -- a Survey Olaf Beyersdorff Mathematical Logic Quarterly 55(2):116--137 2009 Bemerkung: A preliminary version appeared in the Proc. of TAMC'08.
•	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 Bemerkung: Also appeared in: Proc. 2nd Workshop on Reachability Problems in Computational Models, Vol. 223 of Electronic Notes in Theoretical Computer Science, pp. 201--213, 2008.
•	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
•	Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes Olaf Beyersdorff und Zenon Sadowski Proc. 4th International Computer Science Symposium in Russia, Band 5675 aus Lecture Notes in Computer Science, Seite 47 -- 58. Herausgeber: Springer-Verlag, Berlin Heidelberg, 2009
•	Does Advice Help to Prove Propositional Tautologies? Olaf Beyersdorff und Sebastian Müller Proc. 12th International Conference on Theory and Applications of Satisfiability Testing, Band 5584 aus Lecture Notes in Computer Science, Seite 65 -- 72. Herausgeber: Springer-Verlag, Berlin Heidelberg, 2009
•	Edges as Nodes -- a New Approach to Timetable Information Olaf Beyersdorff und Yevgen Nebesov Proc. 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems aus Dagstuhl Research Online Publication Server (DROPS) 2009
•	Nondeterministic Instance Complexity and Proof Systems with Advice Olaf Beyersdorff, Johannes Köbler und Sebastian Müller Proc. 3rd International Conference on Language and Automata Theory and Applications, Band 5457 aus Lecture Notes in Computer Science, Seite 164 -- 175. Herausgeber: Springer-Verlag, Berlin Heidelberg, 2009
•	On the Existence of Complete Disjoint NP-Pairs Olaf Beyersdorff Proc. 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Seite 282--289. Herausgeber: IEEE Computer Society Press, 2009
2008
•	Tuples of Disjoint NP-sets Olaf Beyersdorff Theory of Computing Systems 43(2):118--135 2008 Bemerkung: A preliminary version appeared in the Proc. of CSR'06.
•	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
•	On the Complexity of Elementary Modal Logics Edith Hemaspaandra und Henning Schnoor Proceedings 25th Annual Symposium on Theoretical Aspects of Computer Science, Band 1 aus LIPIcs, Seite 349-360. Herausgeber: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2008 DOI: 10.4230/LIPIcs.STACS.2008.1356
2007
•	Neural Networks and Optimization Algorithms applied for Construction of Low Noise Tread Profiles Matthias Becker, Helena Szczerbicka und Michael Thomas Cybernetics and Systems 38(5&6):535-548 Juni 2007
•	Classes of representable disjoint NP-pairs Olaf Beyersdorff Theoretical Computer Science 377(1--3):93--109 2007 Bemerkung: Preliminary versions appeared in the Proc. of FSTTCS'04 and TAMC'06.
•	Online Scheduling On Multiple Resources Under Stochastic Conditions Michael Thomas und Helena Szczerbicka Systems Science 33(2):23-30 2007
•	The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates Elmar Böhler und Henning Schnoor Theory Comput. Syst. 41(4):753-777 2007 DOI: 10.1007/s00224-006-1301-3
•	Complexity of Default Logic on Generalized Conjunctive Queries Philippe Chapdelaine, Miki Hermann und Ilka Schnoor Proceedings 9th International Conference on Logic Programming and Nonmonotonic Reasoning, Band 4483 aus Lecture Notes in Computer Science, Seite 58-70. Herausgeber: Springer, 2007 DOI: 10.1007/978-3-540-72200-7_7
•	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
•	Enumerating All Solutions for Constraint Satisfaction Problems Henning Schnoor und Ilka Schnoor Proceedings 24th Annual Symposium on Theoretical Aspects of Computer Science, Band 4393 aus Lecture Notes in Computer Science, Seite 694-705. Herausgeber: Springer, 2007 DOI: 10.1007/978-3-540-70918-3_59
•	Evaluating Online Scheduling Techniques in Uncertain Environments Michael Thomas und Helena Szczerbicka Proc. 3rd Multidisciplinary International Scheduling Conference: Theory and Applications, Seite 471-479. Paris, Frankreich 2007
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
•	Von der Turingmaschine zum Quantencomputer -- ein Gang durch die Geschichte der Komplexitätstheorie Johannes Köbler und Olaf Beyersdorff In J. Freytag und W. Reisig, Editor, Themen der Informatik im historischen Kontext Herausgeber: Springer-Verlag, Berlin Heidelberg, 2006
•	Generalized Modal Satisfiability Michael Bauland, Edith Hemaspaandra, Henning Schnoor und Ilka Schnoor Proceedings 23rd Annual Symposium on Theoretical Aspects of Computer Science, Band 3884 aus Lecture Notes in Computer Science, Seite 500-511. Herausgeber: Springer, 2006 DOI: 10.1007/11672142_41
•	New Algebraic Tools for Constraint Satisfaction Henning Schnoor und Ilka Schnoor Complexity of Constraints, Band 06401 aus Dagstuhl Seminar Proceedings Herausgeber: Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006
2005
•	Bases for Boolean co-clones Elmar Böhler, Steffen Reith, Henning Schnoor und Heribert Vollmer Information Processing Letters 96:59-66 2005
•	Complexity of Nonmonotonic Logics - An Incomplete Survey B. Schelm 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
•	Average-Case â€“-- Comparing AvgP, HP and Nearly-P A. Nickelsen und B. Schelm Proceedings 20th Annual IEEE Conference on Computational Complexity, Seite 235-242. 2005
•	Isomorphic implication M. Bauland und E. Hemaspaandra Proceedings 30th International Symposium on Mathematical Foundations of Computer Science, Band 3618, Seite 119-130. 2005
•	The Complexity of the Boolean Formula Value Problem Henning Schnoor Universität Hannover, 2005 Bemerkung: Appeared as The Complexity of Model Checking for Boolean Formulas in Int. J. Found. Comput. Sci.
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 Bemerkung: ESSLLI 2003
•	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 Bemerkung: ACM Computing Research Repository, Technical Report cs.CC/0306134, 2003.
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/ Bemerkung: Springer Lecture Notes in Computer Science
•	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

Please note: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that the publications are offered here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each copyright holder, and make use of the documents only for research and education purpose. These publications may not be reposted without the explicit permission of the copyright holder.

Publikationen

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1990

Links