| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting classes and the fine structure between NC1 and L.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas |
The Complexity of Reasoning for Fragments of Autoepistemic Logic. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer |
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. |
LATA |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer |
On the Parameterized Complexity of Default Logic and Autoepistemic Logic |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer |
Dependence logic with a majority quantifier |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Peter Lohmann, Heribert Vollmer |
Complexity Results for Modal Dependence Logic |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Heribert Vollmer |
Model Checking CTL is Almost Always Inherently Sequential |
Logical Methods in Computer Science |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer |
Proof complexity of propositional default logic. |
Arch. Math. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (eds.) |
Algorithms Unplugged |
|
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer |
Verifying Proofs in Constant Depth. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer |
Dependence logic with a majority quantifier. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting Classes and the Fine Structure between NC1 and L. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Juha Kontinen, Heribert Vollmer |
On Second-Order Monadic Monoidal and Groupoidal Quantifiers |
Logical Methods in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer |
The Complexity of Reasoning for Fragments of Autoepistemic Logic |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Thomas, Heribert Vollmer |
Complexity of Non-Monotonic Logics |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Elmar 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 |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Thomas, Heribert Vollmer |
Complexity of non-monotonic logics. |
Bulletin of the EATCS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer |
The Complexity of Problems for Quantified Constraints. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pierre McKenzie, Michael Thomas, Heribert Vollmer |
Extensional Uniformity for Boolean Circuits. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer |
Proof Complexity of Propositional Default Logic. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting Classes and the Fine Structure between NC1 and L. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Lohmann, Heribert Vollmer |
Complexity Results for Modal Dependence Logic. |
CSL |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer |
The complexity of propositional implication. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk |
The Complexity of Satisfiability for Fragments of CTL and CTL*. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic |
Logical Methods in Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | Heribert Vollmer |
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Post’s lattice, Membership problem, Computational complexity, Clones, Boolean circuit |
| 1 | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
The complexity of satisfiability problems: Refining Schaefer's theorem. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider 0002 |
Model Checking CTL is Almost Always Inherently Sequential. |
TIME |
2009 |
DBLP DOI BibTeX RDF |
Model checking, complexity, temporal logic |
| 1 | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer |
The Complexity of Reasoning for Fragments of Default Logic. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer |
The Complexity of Satisfiability for Fragments of CTL and CTL*. |
Electr. Notes Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Pierre McKenzie, Michael Thomas, Heribert Vollmer |
Extensional Uniformity for Boolean Circuits |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer |
The Complexity of Propositional Implication |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer |
The Complexity of Reasoning for Fragments of Default Logic |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (eds.) |
Taschenbuch der Algorithmen |
|
2008 |
DBLP BibTeX RDF |
|
| 1 | Juha Kontinen, Heribert Vollmer |
On Second-Order Monadic Groupoidal Quantifiers. |
WoLLIC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (eds.) |
Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Heribert Vollmer |
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Michael Thomas, Heribert Vollmer |
Extensional Uniformity for Boolean Circuits. |
CSL |
2008 |
DBLP DOI BibTeX RDF |
descriptive complexity, uniformity, Boolean circuits |
| 1 | Heribert Vollmer |
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor |
The Complexity of Problems for Quantified Constraints. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Thomas Schwentick, Denis Thérien, Heribert Vollmer (eds.) |
Circuits, Logic, and Games, 08.11. - 10.11.2006 |
Circuits, Logic, and Games |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic. |
FoSSaCS |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, linear temporal logic |
| 1 | Heribert Vollmer |
Computational Complexity of Constraint Satisfaction. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, constraint satisfaction, polymorphism, clone, Galois connection, satisfiability problems |
| 1 | Friedrich Steimann, Heribert Vollmer |
Exploiting practical limitations of UML diagrams for model validation and execution. |
Software and System Modeling |
2006 |
DBLP DOI BibTeX RDF |
Validation of models, Modelling, UML, Modelling language |
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer |
The many faces of a translation. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer |
06401 Abstracts Collection - Complexity of Constraints. |
Complexity of Constraints |
2006 |
DBLP BibTeX RDF |
|
| 1 | Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (eds.) |
Complexity of Constraints, 01.10. - 06.10.2006 |
Complexity of Constraints |
2006 |
DBLP BibTeX RDF |
|
| 1 | Thomas Schwentick, Denis Thérien, Heribert Vollmer |
06451 Executive Summary -- Circuits, Logic, and Games . |
Circuits, Logic, and Games |
2006 |
DBLP BibTeX RDF |
|
| 1 | Thomas Schwentick, Denis Thérien, Heribert Vollmer |
06451 Abstracts Collection -- Circuits, Logic, and Games . |
Circuits, Logic, and Games |
2006 |
DBLP BibTeX RDF |
|
| 1 | Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer |
06401 Executive Summary - Complexity of Constraints. |
Complexity of Constraints |
2006 |
DBLP BibTeX RDF |
|
| 1 | Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer |
Bases for Boolean co-clones. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer |
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Matthias Galota, Heribert Vollmer |
Functions computable in polynomial space. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Steffen Reith, Heribert Vollmer |
The complexity of base station positioning in cellular networks. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner |
Arithmetic Circuits and Polynomial Replacement Systems. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. |
SAT |
2004 |
DBLP BibTeX RDF |
|
| 1 | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
The Complexity of Boolean Constraint Isomorphism. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Galota, Sven Kosub, Heribert Vollmer |
Generic separations and leaf languages. |
Math. Log. Q. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Galota, Heribert Vollmer |
Functions Computable in Polynomial Space |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Steffen Reith, Heribert Vollmer |
Optimal satisfiability for propositional calculi and constraint satisfaction problems. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
The Complexity of Boolean Constraint Isomorphism |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Todd Ebert, Wolfgang Merkle, Heribert Vollmer |
On the Autoreducibility of Random Sequences. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Heribert Vollmer |
Complexity Theory Made Easy. |
Developments in Language Theory |
2003 |
DBLP BibTeX RDF |
|
| 1 | Todd Ebert, Wolfgang Merkle, Heribert Vollmer |
On the Autoreducibility of Random Sequences |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
Equivalence and Isomorphism for Boolean Constraint Satisfaction |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
Equivalence and Isomorphism for Boolean Constraint Satisfaction. |
CSL |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Peichl, Heribert Vollmer |
Finite Automata with Generalized Acceptance Criteria. |
Discrete Mathematics & Theoretical Computer Science |
2001 |
DBLP BibTeX RDF |
|
| 1 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schwentick, Denis Thérien, Heribert Vollmer |
Partially-Ordered Two-Way Automata: A New Characterization of DA. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer |
A polynomial-time approximation scheme for base station positioning in UMTS networks. |
DIAL-M |
2001 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design |
| 1 | Matthias Galota, Heribert Vollmer |
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf, Steffen Reith, Heribert Vollmer |
A note on closure properties of logspace MOD classes. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner |
Characterizing Small Depth and Small Space Classes by Operators of Higher Type. |
Chicago J. Theor. Comput. Sci. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Sven Kosub, Heinz Schmitz, Heribert Vollmer |
Uniform Characterizations of Complexity Classes of Functions. |
Int. J. Found. Comput. Sci. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Steffen Reith, Heribert Vollmer |
The Complexity of Base Station Positioning in Cellular Networks. |
ICALP Satellite Workshops |
2000 |
DBLP BibTeX RDF |
|
| 1 | Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer |
The Many Faces of a Translation. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Todd Ebert, Heribert Vollmer |
On the Autoreducibility of Random Sequences. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Reith, Heribert Vollmer |
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner |
Arithmetic Circuits and Polynomial Replacement Systems. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. |
Chicago J. Theor. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Heribert Vollmer |
Was leistet die Komplexitätstheorie für die Praxis? |
Informatik Spektrum |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Heribert Vollmer |
Uniform characterizations of complexity classes. |
SIGACT News |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Heribert Vollmer |
Introduction to circuit complexity - a uniform approach. |
|
1999 |
RDF |
|
| 1 | Timo Peichl, Heribert Vollmer |
Finite Automata with Generalized Acceptance Criteria. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner |
Characterizing Small Depth and Small Space Classes by Operators of Higher Types |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Steffen Reith, Heribert Vollmer |
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Heribert Vollmer |
Relating Polynomial Time to Constant Depth. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Jörg Burtschick, Heribert Vollmer |
Lindström Quantifiers and Leaf Language Definability. |
Int. J. Found. Comput. Sci. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Ronald V. Book, Heribert Vollmer, Klaus W. Wagner |
Probabilistic Type-2 Operators and "Almost"-Classes. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Reith, Heribert Vollmer |
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae |
CoRR |
1998 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")