| 2008 |
|---|
| 10 | EE | 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) |
| 2007 |
|---|
| 9 | EE | Michael Bauland,
Thomas Schneider,
Henning Schnoor,
Ilka Schnoor,
Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
FoSSaCS 2007: 48-62 |
| 2006 |
|---|
| 8 | EE | Michael Bauland,
Edith Hemaspaandra,
Henning Schnoor,
Ilka Schnoor:
Generalized Modal Satisfiability.
STACS 2006: 500-511 |
| 2005 |
|---|
| 7 | EE | Michael Bauland,
Edith Hemaspaandra:
Isomorphic Implication.
MFCS 2005: 119-130 |
| 6 | EE | Eric Allender,
Michael Bauland,
Neil Immerman,
Henning Schnoor,
Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem.
MFCS 2005: 71-82 |
| 5 | EE | 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) |
| 2004 |
|---|
| 4 | EE | Michael Bauland,
Philippe Chapdelaine,
Nadia Creignou,
Miki Hermann,
Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT 2004 |
| 3 | EE | 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 |
| 2 | EE | Michael Bauland,
Edith Hemaspaandra:
Isomorphic Implication
CoRR abs/cs/0412062: (2004) |
| 1 | EE | 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) |
