Michael Bauland

Publication Activity (10 Years)

Years Active: 2004-2011
Publications (10 Years): 0

University of Hanover (PHD)

Education History

University of Hanover

PHD

Publications

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. ACM Trans. Comput. Log. 12 (2) (2011)
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47 (2) (2010)
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) (2009)
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. Electron. Notes Theor. Comput. Sci. 231 (2009)
Michael Bauland, Edith Hemaspaandra
Isomorphic Implication. Theory Comput. Syst. 44 (1) (2009)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic Log. Methods Comput. Sci. 5 (1) (2009)
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 (2008)
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. Electron. Colloquium Comput. Complex. 15 (028) (2008)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS (2007)
Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. 14 (023) (2007)
Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized Modal Satisfiability. STACS (2006)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. 13 (153) (2006)
Michael Bauland, Edith Hemaspaandra
Isomorphic Implication. MFCS (2005)
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Electron. Colloquium Comput. Complex. (024) (2005)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS (2005)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Electron. Colloquium Comput. Complex. (100) (2004)
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (2004)
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers (2004)
Michael Bauland, Edith Hemaspaandra
Isomorphic Implication CoRR (2004)

Michael Bauland.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Michael Bauland