- Konstantin Makarychev (Microsoft Research)
Semidefinite programming and approximation algorithms - Alexander Shen (Montpellier Laboratory of Informatics, Robotics, and Microelectronics and Institute for Information Transmission Problems)
Kolmogorov complexity - Mario Szegedy (Rutgers University)
Lovasz Local Lemma - Ryan Williams (Stanford University)
Connections Between Algorithms and Lower Bounds
CSEDays. Theory 2013
Ural Federal University, Ekaterinburg, Russia, June 29 - July 01