Henning Schnoor

2008
14	EE	Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics. STACS 2008: 349-360
13	EE	Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics CoRR abs/0802.1884: (2008)
12	EE	Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability CoRR abs/0804.2729: (2008)
11	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)
2007
10	EE	Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62
9	EE	Henning Schnoor, Ilka Schnoor: Enumerating All Solutions for Constraint Satisfaction Problems. STACS 2007: 694-705
8	EE	Elmar Böhler, Henning Schnoor: The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Theory Comput. Syst. 41(4): 753-777 (2007)
2006
7	EE	Henning Schnoor, Ilka Schnoor: Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints 2006
6	EE	Henning Schnoor, Ilka Schnoor: New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints 2006
5	EE	Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. STACS 2006: 500-511
2005
4	EE	Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82
3	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)
2	EE	Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer: Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)
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] [4]
2	Michael Bauland	[1] [3] [4] [5] [10] [11]
3	Elmar Böhler	[2] [3] [8]
4	Nadia Creignou	[3]
5	Edith Hemaspaandra (Edith Spaan)	[5] [12] [13] [14]
6	Neil Immerman	[1] [4]
7	Martin Mundhenk	[11]
8	Steffen Reith	[2] [3]
9	Thomas Schneider	[10] [11]
10	Ilka Schnoor	[5] [6] [7] [9] [10] [11] [12]
11	Heribert Vollmer	[1] [2] [3] [4] [10] [11]