Search the dblp DataBase

Publications of Author

1. 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]
   
2. Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
   Generalized Modal Satisfiability. [Citation Graph (0, 0)][DBLP]
   STACS, 2006, pp:500-511 [Conf]
   
3. Henning Schnoor, Ilka Schnoor
   Enumerating All Solutions for Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
   STACS, 2007, pp:694-705 [Conf]
   
4. 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]
   
5. 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]
   
6. Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer
   Bases for Boolean co-clones. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:96, n:2, pp:59-66 [Journal]
   
7. 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]
   
8. 
   Approximability of Manipulating Elections. [Citation Graph (, )][DBLP]
   
   
9. 
   A Simulation-Based Treatment of Authenticated Message Exchange. [Citation Graph (, )][DBLP]
   
   
10. 
    Copeland voting: ties matter. [Citation Graph (, )][DBLP]
    
    
11. 
    Manipulation of copeland elections. [Citation Graph (, )][DBLP]
    
    
12. 
    Strategic planning for probabilistic games with incomplete information. [Citation Graph (, )][DBLP]
    
    
13. 
    Computationally secure two-round authenticated message exchange. [Citation Graph (, )][DBLP]
    
    
14. 
    Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. [Citation Graph (, )][DBLP]
    
    
15. 
    New Algebraic Tools for Constraint Satisfaction. [Citation Graph (, )][DBLP]
    
    
16. 
    Enumerating all Solutions for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]
    
    
17. 
    Partial Polymorphisms and Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]
    
    
18. 
    Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. [Citation Graph (, )][DBLP]
    
    
19. 
    On the Complexity of Elementary Modal Logics. [Citation Graph (, )][DBLP]
    
    
20. 
    On the Complexity of Elementary Modal Logics [Citation Graph (, )][DBLP]
    
    
21. 
    Generalized Modal Satisfiability [Citation Graph (, )][DBLP]
    
    
22. 
    The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments [Citation Graph (, )][DBLP]
    
    
23. 
    The Complexity of Generalized Satisfiability for Linear Temporal Logic [Citation Graph (, )][DBLP]
    
    
24. 
    The Complexity of Generalized Satisfiability for Linear Temporal Logic. [Citation Graph (, )][DBLP]
    
    
25. 
    The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. [Citation Graph (, )][DBLP]
    
    
26. 
    The Complexity of Problems for Quantified Constraints. [Citation Graph (, )][DBLP]
    
    
27. 
    The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. [Citation Graph (, )][DBLP]