Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Schnoor, Henning"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Noninterference with local policies
Sebastian Eggert
,
Henning Schnoor
,
Thomas Wilke
Lecture Notes in Computer Science
8087
, 2013, pp. 337-348
A universally defined undecidable unimodal logic
Edith Hemaspaandra
,
Henning Schnoor
Lecture Notes in Computer Science
6907
, 2011, pp. 364-375
The complexity of problems for quantified constraints
Michael Bauland
,
Elmar Böhler
,
Nadia Creignou
,
Steffen Reith
,
Henning Schnoor
,
Heribert Vollmer
Theory of Computing Systems
47
(2), 2010, pp. 454-490
Generalized modal satisfiability
Edith Hemaspaandra
,
Henning Schnoor
,
Ilka Schnoor
Journal of Computer and System Sciences
76
(7), 2010, pp. 561-578
The complexity of model checking for Boolean formulas
Henning Schnoor
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 289-309
The complexity of satisfiability problems: Refining Schaefer's theorem
Eric Allender
,
Michael Bauland
,
Neil Immerman
,
Henning Schnoor
,
Heribert Vollmer
Journal of Computer and System Sciences
75
(4), 2009, pp. 245-254
On the complexity of elementary modal logics
Edith Hemaspaandra
,
Henning Schnoor
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 349-360
The complexity of the descriptiveness of Boolean circuits over different sets of gates
Elmar Böhler
,
Henning Schnoor
Theory of Computing Systems
41
(4), 2007, pp. 753-777
Enumerating all solutions for constraint satisfaction problems
Henning Schnoor
,
Ilka Schnoor
Lecture Notes in Computer Science
4393
, 2007, pp. 694-705
Generalized modal satisfiability
Michael Bauland
,
Edith Hemaspaandra
,
Henning Schnoor
,
Ilka Schnoor
Lecture Notes in Computer Science
3884
, 2006, pp. 500-511
The complexity of satisfiability problems: Refining Schaefer's theorem
Eric Allender
,
Michael Bauland
,
Neil Immerman
,
Henning Schnoor
,
Heribert Vollmer
Lecture Notes in Computer Science
3618
, 2005, pp. 71-82
Bases for Boolean co-clones
Elmar Böhler
,
Steffen Reith
,
Henning Schnoor
,
Heribert Vollmer
Information Processing Letters
96
(2), 2005, pp. 59-66