DIMAP Warwick Algorithms Day will take place at DIMAP, University of Warwick, on October 24, 2008.

The goal is to bring together the UK community of researchers and graduate students interested in the study of Algorithms, Data Structures, and Complexity. The event will provide exciting invited lectures presenting recent advances in the field and also will provide lots of opportunity for discussions.

DIMAP Algorithms Day will start at about 10:30-11:00 in the morning and will finish before 6pm in the afternoon.

Registration

Participation in the workshop is free, but all participants are asked to register. As a part of the registration, lunch and coffee breaks will be provided.

Speakers

The event will consist of 6 invited presentations:

	Amin Coja-Oghlan (University of Edinburgh) Algorithmic barriers from phase transitions
	Martin E. Dyer (University of Leeds) Flipping regular graphs and a peer-to-peer network
	Philippe Flajolet (INRIA Rocquencourt) Analytic Combinatorics - A calculus of discrete structures
	Leszek Gąsieniec (University of Liverpool) Memory efficient anonymous graph exploration
	Harald Räcke (DIMAP, University of Warwick) Hierarchical decompositions for congestion minimization in networks
	Bernhard von Stengel (London School of Economics) Computing an extensive-form correlated equilibrium in polynomial time