Michael Bauland

2009
16	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. Electr. Notes Theor. Comput. Sci. 231: 277-292 (2009)
15	EE	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)
2008
14	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)
13	EE	Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic CoRR abs/0812.4848: (2008)
12	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. Electronic Colloquium on Computational Complexity (ECCC) 15(028): (2008)
2007
11	EE	Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62
10	EE	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)
2006
9	EE	Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. STACS 2006: 500-511
8	EE	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)
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)

Coauthor Index

1	Eric Allender	[1] [6] [15]
2	Elmar Böhler	[5] [10]
3	Philippe Chapdelaine	[3] [4]
4	Nadia Creignou	[3] [4] [5] [10]
5	Edith Hemaspaandra (Edith Spaan)	[2] [7] [9]
6	Miki Hermann	[3] [4]
7	Neil Immerman	[1] [6] [15]
8	Martin Mundhenk	[12] [14] [16]
9	Steffen Reith	[5] [10]
10	Thomas Schneider	[8] [11] [12] [13] [14] [16]
11	Henning Schnoor	[1] [5] [6] [8] [9] [10] [11] [12] [13] [14] [15] [16]
12	Ilka Schnoor	[8] [9] [11] [12] [13] [14] [16]
13	Heribert Vollmer	[1] [3] [4] [5] [6] [8] [10] [11] [12] [13] [14] [15] [16]