Michael Bauland

20 papers A 2B 3Journal 12Unranked 2
YearRankTypeTitle / Venue / Authors
2011 J jnl
The tractability of model checking for LTL: The good, the bad, and the ugly fragments.
ACM Trans. Comput. Log.
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2010 J jnl
The Complexity of Problems for Quantified Constraints.
Theory Comput. Syst.
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2009 J jnl
Isomorphic Implication.
Theory Comput. Syst.
Michael Bauland, Edith Hemaspaandra
2009 J jnl
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Log. Methods Comput. Sci.
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2009 J jnl
The complexity of satisfiability problems: Refining Schaefer's theorem.
J. Comput. Syst. Sci.
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2008 J jnl
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
CoRR
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2008 J jnl
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments.
Electron. Colloquium Comput. Complex.
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2007 — —
Complexity results for boolean constraint satisfaction problems.
Michael Bauland
2007 B conf
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
FoSSaCS
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2007 J jnl
The Complexity of Problems for Quantified Constraints.
Electron. Colloquium Comput. Complex.
Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
2007 — conf
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments.
M4M
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2006 A conf
Generalized Modal Satisfiability.
STACS
Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2006 J jnl
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
Electron. Colloquium Comput. Complex.
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2005 B conf
Isomorphic Implication.
MFCS
Michael Bauland, Edith Hemaspaandra
2005 J jnl
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
Electron. Colloquium Comput. Complex.
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2005 B conf
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem.
MFCS
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2004 A conf
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004 — conf
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT (Selected Papers
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004 J jnl
Isomorphic Implication
CoRR
Michael Bauland, Edith Hemaspaandra
2004 J jnl
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
Electron. Colloquium Comput. Complex.
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer