Search the dblp DataBase

Publications of Author

1. Michael Bauland, Edith Hemaspaandra
   Isomorphic Implication. [Citation Graph (0, 0)][DBLP]
   MFCS, 2005, pp:119-130 [Conf]
   
2. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
   The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. [Citation Graph (0, 0)][DBLP]
   MFCS, 2005, pp:71-82 [Conf]
   
3. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
   An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
   SAT, 2004, pp:- [Conf]
   
4. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
   An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
   SAT (Selected Papers, 2004, pp:30-45 [Conf]
   
5. Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
   Generalized Modal Satisfiability. [Citation Graph (0, 0)][DBLP]
   STACS, 2006, pp:500-511 [Conf]
   
6. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
   The Complexity of Satisfiability Problems: Refining Schaefer's Theorem [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:100, pp:- [Journal]
   
7. Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
   Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:024, pp:- [Journal]
   
8. Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
   The Complexity of Generalized Satisfiability for Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2007, pp:48-62 [Conf]
   
9. Michael Bauland, Edith Hemaspaandra
   Isomorphic Implication [Citation Graph (0, 0)][DBLP]
   CoRR, 2004, v:0, n:, pp:- [Journal]
   
10. 
    The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments [Citation Graph (, )][DBLP]
    
    
11. 
    The Complexity of Generalized Satisfiability for Linear Temporal Logic [Citation Graph (, )][DBLP]
    
    
12. 
    The Complexity of Generalized Satisfiability for Linear Temporal Logic. [Citation Graph (, )][DBLP]
    
    
13. 
    The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. [Citation Graph (, )][DBLP]
    
    
14. 
    The Complexity of Problems for Quantified Constraints. [Citation Graph (, )][DBLP]
    
    
15. 
    The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. [Citation Graph (, )][DBLP]