 | 2009 |
|---|
| 100 |       | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic.
SAT 2009: 51-64 |
| 99 | | Michael Bauland,
Martin Mundhenk,
Thomas Schneider,
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. 231: 277-292 (2009) |
| 98 | | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The complexity of propositional implication.
Inf. Process. Lett. 109(18): 1071-1077 (2009) |
| 97 | | Arne Meier,
Michael Thomas,
Heribert Vollmer,
Martin Mundhenk:
The Complexity of Satisfiability for Fragments of CTL and CTL*.
Int. J. Found. Comput. Sci. 20(5): 901-918 (2009) |
| 96 | | Eric Allender,
Michael Bauland,
Neil Immerman,
Henning Schnoor,
Heribert Vollmer:
The complexity of satisfiability problems: Refining Schaefer's theorem.
J. Comput. Syst. Sci. 75(4): 245-254 (2009) |
| 95 | | Heribert Vollmer:
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis.
Theory Comput. Syst. 44(1): 82-90 (2009) |
| 2008 |
|---|
| 94 | | Nadia Creignou,
Phokion G. Kolaitis,
Heribert Vollmer:
Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar].
Springer 2008 |
| 93 |  | Berthold Vöcking,
Helmut Alt,
Martin Dietzfelbinger,
Rüdiger Reischuk,
Christian Scheideler,
Heribert Vollmer,
Dorothea Wagner:
Taschenbuch der Algorithmen
Springer 2008 |
| 92 | | Pierre McKenzie,
Michael Thomas,
Heribert Vollmer:
Extensional Uniformity for Boolean Circuits.
CSL 2008: 64-78 |
| 91 | | Nadia Creignou,
Heribert Vollmer:
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?.
Complexity of Constraints 2008: 3-37 |
| 90 | | Juha Kontinen,
Heribert Vollmer:
On Second-Order Monadic Groupoidal Quantifiers.
WoLLIC 2008: 238-248 |
| 89 | | Michael Bauland,
Martin Mundhenk,
Thomas Schneider,
Henning Schnoor,
Ilka Schnoor,
Heribert Vollmer:
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
CoRR abs/0805.0498: (2008) |
| 88 | | Pierre McKenzie,
Michael Thomas,
Heribert Vollmer:
Extensional Uniformity for Boolean Circuits
CoRR abs/0805.4072: (2008) |
| 87 | | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic
CoRR abs/0808.3884: (2008) |
| 86 | | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The Complexity of Propositional Implication
CoRR abs/0811.0959: (2008) |
| 85 | | Arne Meier,
Martin Mundhenk,
Michael Thomas,
Heribert Vollmer:
The Complexity of Satisfiability for Fragments of CTL and CTL*.
Electr. Notes Theor. Comput. Sci. 223: 201-213 (2008) |
| 84 | | Michael Bauland,
Martin Mundhenk,
Thomas Schneider,
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) 15(028): (2008) |
| 83 | | Michael Bauland,
Thomas Schneider,
Henning Schnoor,
Ilka Schnoor,
Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Logical Methods in Computer Science 5(1): (2008) |
| 2007 |
|---|
| 82 | | Thomas Schwentick,
Denis Thérien,
Heribert Vollmer:
Circuits, Logic, and Games, 08.11. - 10.11.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 81 | | Heribert Vollmer:
Computational Complexity of Constraint Satisfaction.
CiE 2007: 748-757 |
| 80 | | Michael Bauland,
Thomas Schneider,
Henning Schnoor,
Ilka Schnoor,
Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
FoSSaCS 2007: 48-62 |
| 79 | | 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) 14(023): (2007) |
| 78 | | 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) 14(045): (2007) |
| 2006 |
|---|
| 77 | | Nadia Creignou,
Phokion G. Kolaitis,
Heribert Vollmer:
Complexity of Constraints, 01.10. - 06.10.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 76 | | Thomas Schwentick,
Denis Thérien,
Heribert Vollmer:
06451 Abstracts Collection -- Circuits, Logic, and Games .
Circuits, Logic, and Games 2006 |
| 75 | | Thomas Schwentick,
Denis Thérien,
Heribert Vollmer:
06451 Executive Summary -- Circuits, Logic, and Games .
Circuits, Logic, and Games 2006 |
| 74 | | Nadia Creignou,
Phokion G. Kolaitis,
Heribert Vollmer:
06401 Abstracts Collection - Complexity of Constraints.
Complexity of Constraints 2006 |
| 73 | | Nadia Creignou,
Phokion G. Kolaitis,
Heribert Vollmer:
06401 Executive Summary - Complexity of Constraints.
Complexity of Constraints 2006 |
| 72 | | Michael Bauland,
Thomas Schneider,
Henning Schnoor,
Ilka Schnoor,
Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
Electronic Colloquium on Computational Complexity (ECCC) 13(153): (2006) |
| 71 | | Pierre McKenzie,
Thomas Schwentick,
Denis Thérien,
Heribert Vollmer:
The many faces of a translation.
J. Comput. Syst. Sci. 72(1): 163-179 (2006) |
| 70 | | Friedrich Steimann,
Heribert Vollmer:
Exploiting practical limitations of UML diagrams for model validation and execution.
Software and System Modeling 5(1): 26-47 (2006) |
| 2005 |
|---|
| 69 | | Eric Allender,
Michael Bauland,
Neil Immerman,
Henning Schnoor,
Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem.
MFCS 2005: 71-82 |
| 68 | | Christian Glaßer,
Steffen Reith,
Heribert Vollmer:
The complexity of base station positioning in cellular networks.
Discrete Applied Mathematics 148(1): 1-12 (2005) |
| 67 | | 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)(024): (2005) |
| 66 | | Matthias Galota,
Heribert Vollmer:
Functions computable in polynomial space.
Inf. Comput. 198(1): 56-70 (2005) |
| 65 | | Elmar Böhler,
Steffen Reith,
Henning Schnoor,
Heribert Vollmer:
Bases for Boolean co-clones.
Inf. Process. Lett. 96(2): 59-66 (2005) |
| 2004 |
|---|
| 64 | | Michael Bauland,
Philippe Chapdelaine,
Nadia Creignou,
Miki Hermann,
Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT 2004 |
| 63 | | Michael Bauland,
Philippe Chapdelaine,
Nadia Creignou,
Miki Hermann,
Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT (Selected Papers 2004: 30-45 |
| 62 | | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism.
STACS 2004: 164-175 |
| 61 | | 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)(100): (2004) |
| 60 | | Pierre McKenzie,
Heribert Vollmer,
Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems.
SIAM J. Comput. 33(6): 1513-1531 (2004) |
| 2003 |
|---|
| 59 | | Heribert Vollmer:
Complexity Theory Made Easy.
Developments in Language Theory 2003: 95-110 |
| 58 | | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism
CoRR cs.CC/0306134: (2003) |
| 57 | | Matthias Galota,
Heribert Vollmer:
Functions Computable in Polynomial Space
Electronic Colloquium on Computational Complexity (ECCC) 10(018): (2003) |
| 56 | | Steffen Reith,
Heribert Vollmer:
Optimal satisfiability for propositional calculi and constraint satisfaction problems.
Inf. Comput. 186(1): 1-19 (2003) |
| 55 | | Matthias Galota,
Sven Kosub,
Heribert Vollmer:
Generic separations and leaf languages.
Math. Log. Q. 49(4): 353-362 (2003) |
| 54 | | Todd Ebert,
Wolfgang Merkle,
Heribert Vollmer:
On the Autoreducibility of Random Sequences.
SIAM J. Comput. 32(6): 1542-1569 (2003) |
| 2002 |
|---|
| 53 | | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction.
CSL 2002: 412-426 |
| 52 | | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CoRR cs.CC/0202036: (2002) |
| 51 | | Todd Ebert,
Wolfgang Merkle,
Heribert Vollmer:
On the Autoreducibility of Random Sequences
Electronic Colloquium on Computational Complexity (ECCC)(056): (2002) |
| 2001 |
|---|
| 50 | | Matthias Galota,
Heribert Vollmer:
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem.
CSL 2001: 355-368 |
| 49 | | Matthias 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 |
| 48 | | Thomas Schwentick,
Denis Thérien,
Heribert Vollmer:
Partially-Ordered Two-Way Automata: A New Characterization of DA.
Developments in Language Theory 2001: 239-250 |
| 47 | | Timo Peichl,
Heribert Vollmer:
Finite Automata with Generalized Acceptance Criteria.
Discrete Mathematics & Theoretical Computer Science 4(2): 179-192 (2001) |
| 46 | | Clemens Lautemann,
Pierre McKenzie,
Thomas Schwentick,
Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL.
J. Comput. Syst. Sci. 62(4): 629-652 (2001) |
| 2000 |
|---|
| 45 | | Pierre McKenzie,
Heribert Vollmer,
Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems.
FSTTCS 2000: 164-175 |
| 44 | | Pierre McKenzie,
Thomas Schwentick,
Denis Thérien,
Heribert Vollmer:
The Many Faces of a Translation.
ICALP 2000: 890-901 |
| 43 | | Christian Glaßer,
Steffen Reith,
Heribert Vollmer:
The Complexity of Base Station Positioning in Cellular Networks.
ICALP Satellite Workshops 2000: 167-178 |
| 42 | | Todd Ebert,
Heribert Vollmer:
On the Autoreducibility of Random Sequences.
MFCS 2000: 333-342 |
| 41 | | Steffen Reith,
Heribert Vollmer:
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems.
MFCS 2000: 640-649 |
| 40 | | 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: (2000) |
| 39 | | Ulrich Hertrampf,
Steffen Reith,
Heribert Vollmer:
A note on closure properties of logspace MOD classes.
Inf. Process. Lett. 75(3): 91-93 (2000) |
| 38 | | Sven Kosub,
Heinz Schmitz,
Heribert Vollmer:
Uniform Characterizations of Complexity Classes of Functions.
Int. J. Found. Comput. Sci. 11(4): 525-551 (2000) |
| 1999 |
|---|
| 37 | | Timo Peichl,
Heribert Vollmer:
Finite Automata with Generalized Acceptance Criteria.
ICALP 1999: 605-614 |
| 36 | | Clemens Lautemann,
Pierre McKenzie,
Thomas Schwentick,
Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL.
STACS 1999: 444-454 |
| 35 | | Stephen A. Fenner,
Frederic Green,
Steven Homer,
Alan L. Selman,
Thomas Thierauf,
Heribert Vollmer:
Complements of Multivalued Functions.
Chicago J. Theor. Comput. Sci. 1999: (1999) |
| 34 | | Heribert Vollmer:
Was leistet die Komplexitätstheorie für die Praxis?
Informatik Spektrum 22(5): 317-327 (1999) |
| 33 | | Heribert Vollmer:
Uniform characterizations of complexity classes.
SIGACT News 30(1): 17-27 (1999) |
| 1998 |
|---|
| 32 | | Sven Kosub,
Heinz Schmitz,
Heribert Vollmer:
Uniformly Defining Complexity Classes of Functions.
STACS 1998: 607-617 |
| 31 | | Clemens Lautemann,
Pierre McKenzie,
Thomas Schwentick,
Heribert Vollmer:
The descriptive complexity approach to LOGCFL
CoRR cs.CC/9809114: (1998) |
| 30 | | Heribert Vollmer:
A Generalized Quantifier Concept in Computational Complexity Theory
CoRR cs.CC/9809115: (1998) |
| 29 | | Steffen Reith,
Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
CoRR cs.CC/9809116: (1998) |
| 28 | | Ronald V. Book,
Heribert Vollmer,
Klaus W. Wagner:
Probabilistic Type-2 Operators and "Almost"-Classes.
Computational Complexity 7(3): 265-289 (1998) |
| 27 | | Steffen Reith,
Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Electronic Colloquium on Computational Complexity (ECCC) 5(22): (1998) |
| 26 | | 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) 5(57): (1998) |
| 25 | | Clemens Lautemann,
Pierre McKenzie,
Thomas Schwentick,
Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL
Electronic Colloquium on Computational Complexity (ECCC) 5(59): (1998) |
| 24 | | Hans-Jörg Burtschick,
Heribert Vollmer:
Lindström Quantifiers and Leaf Language Definability.
Int. J. Found. Comput. Sci. 9(3): 277-294 (1998) |
| 23 | | Hervé Caussinus,
Pierre McKenzie,
Denis Thérien,
Heribert Vollmer:
Nondeterministic NC1 Computation.
J. Comput. Syst. Sci. 57(2): 200-212 (1998) |
| 22 | | Heribert Vollmer:
Relating Polynomial Time to Constant Depth.
Theor. Comput. Sci. 207(1): 159-170 (1998) |
| 21 | | K. Cronauer,
Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
The Chain Method to Separate Counting Classes.
Theory Comput. Syst. 31(1): 93-108 (1998) |
| 1997 |
|---|
| 20 | | Heribert Vollmer,
Klaus W. Wagner:
Measure One Results in Computational Complexity Theory.
Advances in Algorithms, Languages, and Complexity 1997: 285-312 |
| 19 | | Heribert Vollmer:
A Generalized Quantifier Concept in Computational Complexity Theory.
ESSLLI 1997: 99-123 |
| 18 | | Heribert Vollmer,
Klaus W. Wagner:
On Operators of Higher Types.
IEEE Conference on Computational Complexity 1997: 174-184 |
| 17 | | Kenneth W. Regan,
Heribert Vollmer:
Gap-Languages and Log-Time Complexity Classes.
Theor. Comput. Sci. 188(1-2): 101-116 (1997) |
| 1996 |
|---|
| 16 | | Heribert Vollmer:
Relations Among Parallel and Sequential Computation Models.
ASIAN 1996: 23-32 |
| 15 | | Ronald V. Book,
Heribert Vollmer,
Klaus W. Wagner:
On Type-2 Probabilistic Quantifiers.
ICALP 1996: 369-380 |
| 14 | | Hervé Caussinus,
Pierre McKenzie,
Denis Thérien,
Heribert Vollmer:
Nondeterministic NC1 Computation.
IEEE Conference on Computational Complexity 1996: 12-21 |
| 13 | | Stephen A. Fenner,
Frederic Green,
Steven Homer,
Alan L. Selman,
Thomas Thierauf,
Heribert Vollmer:
Complements of Multivalued Functions.
IEEE Conference on Computational Complexity 1996: 260-269 |
| 12 | | Ronald V. Book,
Heribert Vollmer,
Klaus W. Wagner:
Probabilistic Type-2 Operators and ``Almost''-Classes
Electronic Colloquium on Computational Complexity (ECCC) 3(35): (1996) |
| 11 | | Hans-Jörg Burtschick,
Heribert Vollmer:
Lindstroem Quantifiers and Leaf Language Definability
Electronic Colloquium on Computational Complexity (ECCC) 3(5): (1996) |
| 10 | | Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
On Balanced Versus Unbalanced Computation Trees.
Mathematical Systems Theory 29(4): 411-421 (1996) |
| 9 | | Heribert Vollmer,
Klaus W. Wagner:
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions.
Theor. Comput. Sci. 163(1&2): 245-258 (1996) |
| 1995 |
|---|
| 8 | | Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
On the Power of Number-Theoretic Operations with Respect to Counting.
Structure in Complexity Theory Conference 1995: 299-314 |
| 7 | | Heribert Vollmer,
Klaus W. Wagner:
Complexity Classes of Optimization Functions
Inf. Comput. 120(2): 198-219 (1995) |
| 6 | | Lane A. Hemaspaandra,
Heribert Vollmer:
The satanic notations: counting classes beyond #P and other definitional adventures.
SIGACT News 26(1): 2-13 (1995) |
| 1994 |
|---|
| 5 | | Heribert Vollmer:
On Different Reducibility Notions for Function Classes.
STACS 1994: 449-460 |
| 1993 |
|---|
| 4 | | Ulrich Hertrampf,
Clemens Lautemann,
Thomas Schwentick,
Heribert Vollmer,
Klaus W. Wagner:
On the Power of Polynomial Time Bit-Reductions (Extended Abstract).
Structure in Complexity Theory Conference 1993: 200-207 |
| 3 | | Heribert Vollmer,
Klaus W. Wagner:
The Complexity of Finding Middle Elements.
Int. J. Found. Comput. Sci. 4(4): 293-307 (1993) |
| 1992 |
|---|
| 2 | | Ulrich Hertrampf,
Clemens Lautemann,
Thomas Schwentick,
Heribert Vollmer,
Klaus W. Wagner:
On the Power of Polynomial Bit-Reductions
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-28: (1992) |
| 1990 |
|---|
| 1 | | Heribert Vollmer:
The Gap-Language-Technique Revisited.
CSL 1990: 389-399 |
