Friday, October 24, 2008
10:30 – 11:00	Registration, coffee and pastries. Warwick Mathematics Institute D1.07
Morning Session. Room D1.07
11:00 – 11:05	Opening
11:05 – 11:45	Leszek Gąsieniec University of Liverpool	Memory efficient anonymous graph exploration
11:45 – 12:25	Martin E. Dyer University of Leeds	Flipping regular graphs and a peer-to-peer network
12:25 – 14:20	Lunch break
Afternoon Session. Room D1.07
14:20 – 15:00	Amin Coja-Oghlan University of Edinburgh	Algorithmic barriers from phase transitions
15:00 – 15:40	Philippe Flajolet INRIA Rocquencourt	Analytic Combinatorics - A calculus of discrete structures
15:40 – 16:20	Coffee break
16:20 – 17:00	Harald Räcke University of Warwick	Hierarchical decompositions for congestion minimization in networks
17:00 – 17:40	Bernhard von Stengel London School of Economics	Computing an extensive-form correlated equilibrium in polynomial time