Slides
- Franz Baader (Technische Dresden), Reasoning in Description Logics [intermediate, 6 hours]
- Manfred Droste (Leipzig), Weighted Automata and Weighted Logic [introductory/advanced, 8 hours]
- Venkatesan Guruswami (Carnegie Mellon), The Complexity of Approximate Constraint Satisfaction [intermediate, 6 hours](pdf, 900KB)
- Tao Jiang (California Riverside), Average-case Analysis and Lower Bounds by the Incompressibility Method [intermediate, 6 hours](pdf, 258KB)
- Helmut Seidl (Technische München), Macro Treetransducers for XML Processing [intermediate, 6 hours]
- Alan Selman (Buffalo), Probabilistic Complexity Classes [intermediate, 10 hours] (non-public materials, only for the use of students)
- Jeffrey Shallit (Waterloo), Automatic Sequences, Decidability, and Enumeration [intermediate, 6 hours]