Recent Advances in Algorithms
International Computer Science Student School
May 22–26, 2017, St. Petersburg, Russia
AIM OF THE SCHOOL
The school offers the unique opportunity to learn about recent breakthroughs
in several domains of algorithms: from classical areas like network flow algorithms
and longest paths in graphs to recently emerged areas like streaming algorithms
and algorithms for high dimensional data. The lectures will be taught by the leading
researchers in these areas. Each of the tutorials will provide an introduction to the
area and gradually bring to the current research frontiers.
The primarily audience consists of PhD students interested in Algorithms.
Bright master students, postdocs, young researchers and even faculty
are also very welcome.
Michael Kapralov (EPFL)
Aleksander Mądry (MIT)
Graph Algorithms and Continuous Optimization
Ilya Razenshteyn (MIT)
Algorithms for High-Dimensional Data
Saket Saurabh (IMSc)
Longest Paths in Graphs: Parameterized Algorithms
The school is hosted by St. Petersburg Department of V.A. Steklov Institute of Mathematics
of the Russian Academy of Sciences which is located in the very center of St. Petersburg.
St. Petersburg is particularly beautiful in the late spring — early summer, the white nights
season. The city is surrounded by wonderful tsar parks and palaces; an excursion to one
of them will be a social program of the school.
More details will be available soon. Please subscribe to the mailing list to receive the updates: