Program

This year's ADFOCS features three lecturers, each of which will give three lectures and two exercise sessions. They will be distributed to eight blocks of about four hours. A typical morning or afternoon block will start with 1 1/2 hours of lecture, followed by 1 1/2 hours of exercises (in small groups without the lecturers) with coffee break and an 1 hour discussion of the exercises with the lecturers. During the exercise periods, the respective lecturer will be around, as well as some fruits, snacks, and drinks.

There will be an additional slot for the members of the Algorithms and Complexity Group (D1) at MPI to introduce the different research areas of the group.

Program [PDF File]

On Wednesday morning, five people at MPII will present their own work. Here are the titles of their work:

• Kurt Mehlhorn: The Slime Mold Physarum Can Compute Shortest Paths
• Chandan Saha: Identity Testing and Lower Bounds Using Algebraic Independence
• Thomas Sauerwald: Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
• Magnus Wahlström: Mimicking Terminal Cuts with Small Graphs
• Carola Winzen: The Randomized Query Complexity of Mastermind

On Friday afternoon, Professor Vijay V. Vazirani from Georgia Tech will give a talk at MPI. All the participants of ADFOCS are welcome to attend. Here is the information of the talk.

• Title: Dispelling an Old Myth about an Ancient Algorithm
• Speaker: Vijay V. Vazirani
• Time: 2:00pm - 3:30pm, Friday August 17.

Excursion

For the excursion, we will go to Strasbourg. A bus will depart from the university around 12:30 pm, and we will be back in Saarbruecken, city center, at approximately 8:30 pm. Since there will be no time for lunch before departure, sandwiches will be provided.

ADFOCS 2012

• Homepage
• Infomation for Participants
• Program
• Registration
• Lecture Material
• Grants
• Poster
• Travel Information
• Pictures
• History