Thursday, May 20, Morning (Chair M. Santha)

09h00-09h05: Welcoming
09h05-09h55: Randomized algorithms over the real and complex numbers
             Pascal Koiran (Lyon) 
09h55-10h15: A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation
             Christos Levcopoulos (Lund)
10h15-10h45: Coffee break
10h45-11h30: Algorithmic and analytic aspects of the digital tree process
             Philippe Flajolet (Rocquencourt)
11h30-12h15: A Unifying  Framework for the Analysis of a Class of Euclidean Algorithms
             Brigitte Vallee (Caen)



12h15-14h00: LUNCH 
14h00-14h30: Payment for stays in the Centre the Formation



Thursday, May 20, Afternoon (Chair M. Karpinski)

14h30-15h15: Optimal Bounds for the Predecessor Problem
             Faith Fich (Orsay)
15h15-16h00: Independent sets in bounded-degree graphs.
             Mark Jerrum (Edinburgh)
16h00-16h30: Coffee break
16h30-17h15: The complexity of counting graph homomorphisms
             Catherine Greenhill (Leeds)
17h15-17h45: Slow mixing of random walks for graph homomorphisms
             Martin Dyer (Leeds)




Friday, May 21, Morning (Chair D. Welsh)

09h00-09h40: Quantum Counting
             Michele Mosca (Oxford)
09h40-10h30: Quantum Communication Complexity
             Harry Buhrman (Amsterdam)
10h30-11h00: Coffee break
11h00-11h50: Spooky Communication Complexity
             Gilles Brassard (Montreal)
11h50-12h30: Quantum Complexity in the Black-Box Model
             Ronald de Wolf (Amsterdam)



12h30-14h30: LUNCH



Friday, May 21, Afternoon (Chair M. Dyer)

14h30-15h15: Sorting by Reversals is Hard to Approximate Within Certain Constant
             Marek Karpinski (Bonn) 
15h15-16h00: Concentration for random minimmum spanning trees
             Colin McDiarmid (Oxford)
16h00-16h30: Coffe break
16h30-17h00: The Giant Component is Normal
             Stephane Boucheron (Orsay)
17h00-17h45: How tall are the trees?
             Bruce Reed (Paris)




Saturday, May 22, Morning (Chair M. Jerrum)

09h00-09h50: Relaxation properties of Metropolis and Kawasaki dynamics for lattice spin models: an overview
             Martinelli Fabio (Roma)
09h50-10h35: Fast randomized algorithms for matrix algebras over finite fields
             Gabor Ivanyos (Budapest)
10h35-11h05: Coffee break
11h05-11h35: Improved Bounds for Random-Self-Reductions, Rounds, and Advice
             Sophie Laplante (Orsay)
11h35-12h20: On Recycling the Randomness of States in Space Bounded Computation
             Ran Raz (Rehovot)