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="Bauland, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
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
Isomorphic implication
Michael Bauland
,
Edith Hemaspaandra
Theory of Computing Systems
44
(1), 2009, pp. 117-139
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
Isomorphic implication
Michael Bauland
,
Edith Hemaspaandra
Lecture Notes in Computer Science
3618
, 2005, pp. 119-130