Michael Bauland

According to our database, Michael Bauland authored at least 9 papers between 2004 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Isomorphic Implication.

Michael Bauland, Edith Hemaspaandra

Theory Comput. Syst., 2009

The complexity of satisfiability problems: Refining Schaefer's theorem.

Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer

J. Comput. Syst. Sci., 2009

2008

The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments.

Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer

Electron. Colloquium Comput. Complex., 2008

2007

Complexity results for boolean constraint satisfaction problems.

Michael Bauland

PhD thesis, 2007

The Complexity of Problems for Quantified Constraints.

Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor

Electron. Colloquium Comput. Complex., 2007

2006

The Complexity of Generalized Satisfiability for Linear Temporal Logic.

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer

Electron. Colloquium Comput. Complex., 2006

Generalized Modal Satisfiability.

Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor

Proceedings of the STACS 2006, 2006

2005

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer

Electron. Colloquium Comput. Complex., 2005

2004

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.

Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer

Proceedings of the Theory and Applications of Satisfiability Testing, 2004