Invited Speakers
 | Dima Grigoriev Institut des Mathématiques de Lille, France Complexity lower bounds for algebraic computation trees |  | Manindra Agrawal Indian Institute of Technology Kanpur, India The Arithmetic Complexity of Euler Function | ||
 | László Babai University of Chicago, USA |  | Andrei Bulatov Simon Fraser University, Canada On the CSP Dichotomy conjecture | ||
 | Jarkko Kari University of Turku, Finland Snakes and Cellular Automata: Reductions and Inseparability Results |  | Alexander Shen LIF Marseille, France Kolmogorov Complexity as a Language | ||
 | Amir Shpilka Technion, Israel Recent Results on Polynomial Identity Testing |  | Madhu Sudan MIT & Microsoft Research, USA The method of multiplicities | ||
 | Sergey Yekhanin Microsoft Research, USA Locally decodable codes |