Invited Talks
Sanjeev Arora
Princeton, Princeton
Overcoming Intractability in Unsupervised Learning (PDF)
Manuel Bodirsky
TU Dresden
The Complexity of Constraint Satisfaction Problems (PDF)
Peter Sanders
KIT, Karlsruhe
Parallel Algorithms Reconsidered