Invited speakers

Speaker Affiliation Appetizer
Libor Barto Charles University “There is a connection between the complexity and a certain concept capturing symmetry of computational problems”
Bernard Chazelle Princeton University “I work in natural algorithms now (algorithms for dynamical systems) and … I would prefer to give a talk about that topic.”
Kousha Etessami University of Edinburgh Verification, model checking, stochastic processes, automata-theoretic models, process-algebraic models
Torben Hagerup University of Augsburg “I will put together a survey of old and new results concerning computation that uses little time and little space.”