|
|
|
Homepage
Program Registration Accomodation Grants Feedback & Pictures |
|
|
Bruce MaggsCarnegie Mellon University& Akamai Technologies Network problems in theory and practice |
David ShmoysCornell University
Approximation algorithms for clustering problems: |
Peter Bro MiltersenUniversity of Aarhus
Universal methods |
Emo WelzlETH Zürich
Randomized and combinatorial methods |
ADFOCS is organized as part of the activities of the Algorithms and Complexity Group and the International Max-Planck Research School of the Max-Planck-Institut für Informatik. The scope of ADFOCS is international and it is addressed mainly to young researchers at the PhD student or postdoc level. The goal of ADFOCS is to provide an overview of selected topics from the foundations of computer science and to highlight major research directions in these areas. For more information on this year's lecturers, lectures, and schedule see the