Computer Science E-days (CSEDays)
Algorithms and Complexity
Ekaterinburg, Russia, June 29 -- July 01, 2013
http://www.csedays.ru/theory2013/about

LECTURERS

Konstantin Makarychev (Microsoft Research, US)
Semidefinite programming and approximation algorithms

Alexander Shen (Montpellier Laboratory of Informatics, Robotics,
and Microelectronics and Institute for Information Transmission Problems, RU)
Kolmogorov complexity

Mario Szegedy (Rutgers University, US)
Lovász Local Lemma

Ryan Williams (Stanford University, US)
Connections Between Algorithms and Lower Bounds

ABOUT THE SCHOOL

The school will be held in Ekaterinburg, Russia on June 29 -- July 01, 2013.
The topic of the school is "Algorithms and Complexity". The program will
consist of 4 short lecture courses as well as student presentations and
poster sessions. Students are encouraged to submit not only published or
completed research, but also a short summary of work in progress or even a
concise review of a problem area. The primary goal of submitting a paper,
as we see it, is getting feedback from experts in complexity theory as well
as school lecturers and participants.

The school will be held right after the 8th International Computer Science
Symposium in Russia (CSR 2013, June 25--29): http://csr2013.urfu.ru/
Any participant of the school may arrive earlier and attend the talks of
the CSR 2013 without paying the conference registration fee.

Application form: http://www.csedays.ru/theory2013/form
Deadline: April 10, 2013