Recent Advances in Algorithms 2017
School main web site: http://raa-school.org
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.
LECTURERS AND COURSES
Michael Kapralov |
Aleksander Mądry |
Ilya Razenshteyn |
Saket Saurabh |
VENUE
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. Please check useful information about St. Petersburg and weather forecast before coming.
RAA SCHEDULE
| 12:30–14:30 | Registration | |
| 14:30–15:30 | Aleksander Mądry | Graph Algorithms and Continuous Optimization Part I: Overview |
| 15:30–16:00 | Coffee break | |
| 16:00–17:00 | Aleksander Mądry | Graph Algorithms and Continuous Optimization Part 2: Unconstrained Minimization |
| 10:00–11:00 | Aleksander Mądry | Graph Algorithms and Continuous Optimization Part 3: Fast (Laplacian) Linear System Solving |
| 11:00–11:30 | Coffee break | |
| 11:30–12:30 | Ilya Razenshteyn | Algorithms for High-Dimensional Data Lecture 1: Introduction and Measure Concentration |
| 12:30–14:30 | Lunch | |
| 14:30–15:30 | Michael Kapralov | Streaming Algorithms Lecture 1: Distinct Elements and Frequency Moments in Data Streams |
| 15:30–16:00 | Coffee break | |
| 16:00–17:00 | Saket Saurabh | Longest Paths in Graphs: Parameterized Algorithms Lecture I: Basics of Parameterized Algorithms, Long Path in 80's and Representative Sets |
| 10:00–11:00 | Aleksander Mądry | Lecture: Graph Algorithms and Continuous Optimization |
| 11:00–11:30 | Coffee break | |
| 11:30–12:30 | Ilya Razenshteyn | Algorithms for High-Dimensional Data Lecture 2: Dimension Reduction |
| 12:30–14:30 | Lunch | |
| 14:30–15:30 | Michael Kapralov | Streaming Algorithms Lecture 2: Frequency Moments, Heavy Hitters |
| 15:30–16:00 | Coffee break | |
| 16:00–17:00 | Saket Saurabh | Longest Paths in Graphs: Parameterized Algorithms Two Families Theorem: A Few Combinatorial Applications Representative SET Computation |
| 10:00–11:00 | Ilya Razenshteyn | Algorithms for High-Dimensional Data Lecture 3: Theory of Nearest Neighbor Search |
| 11:00–11:30 | Coffee break | |
| 11:30–12:30 | Saket Saurabh | Longest Paths in Graphs: 90's and 00's |
| 12:30–14:00 | Lunch | |
| 14:00–19:00 | Excursion | |
| 19:90–21:00 | Dinner | |
| 10:00–11:00 | Michael Kapralov | Streaming Algorithms Lecture 3: CountSketch, Graph sketching, l0 Samplers |
| 11:00–11:30 | Coffee break | |
| 11:30–12:30 | Michael Kapralov | Streaming Algorithms |
| 12:30–14:30 | Lunch | |
| 14:30–15:30 | Ilya Razenshteyn | Algorithms for High-Dimensional Data Lecture 4: Practice of Nearest Neighbor Search |
| 15:30–16:00 | Coffee break | |
| 16:00–17:00 | Saket Saurabh | Longest Paths in Graphs Parameterized Algorithms Algebraic-Technique |
ORGANIZERS AND SPONSORS
Fedor Fomin, Alexander S. Kulikov, Alexandra Novikova, Alexander Smal
 |
 |
 |
 |