International Computer Science Student School
Recent Advances in Algorithms
MAY 22–26, 2017, ST. PETERSBURG
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
EPFL
Streaming Algorithms
MIT
Graph Algorithms and Continuous Optimization
MIT
Algorithms for High-Dimensional Data
IMSc
Longest Paths in Graphs: Parameterized Algorithms
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
Monday, May 22
12:30 – 14:30
12:30 – 14:30
Registration
14:30 – 15:30
14:30 – 15:30
Graph Algorithms and Continuous Optimization
Part I: Overview (slides)
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Graph Algorithms and Continuous Optimization
Part 2: Unconstrained Minimization (notes and blackboard notes)
Tuesday, May 23
10:00 – 11:00
10:00 – 11:00
Graph Algorithms and Continuous Optimization
Part 3: Fast (Laplacian) Linear System Solving (notes and blackboard notes)
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Algorithms for High-Dimensional Data. Introduction (slides pdf pptx)
12:30 – 14:30
12:30 – 14:30
Lunch
14:30 – 15:30
14:30 – 15:30
Streaming Algorithms
Lecture 1: Distinct Elements and Frequency Moments in Data Streams (slides)
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Longest Paths in Graphs: Parameterized Algorithms
Lecture I: Basics of Parameterized Algorithms, Long Path in 80's and Representative Sets (slides and exercise)
Wednesday, May 24
10:00 – 11:00
10:00 – 11:00
Lecture: Graph Algorithms and Continuous Optimization (blackboard notes)
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Algorithms for High-Dimensional Data
Chapter 1: Dimension Reduction (slides pdf pptx)
12:30 – 14:30
12:30 – 14:30
Lunch
14:30 – 15:30
14:30 – 15:30
Streaming Algorithms
Lecture 2: Frequency Moments, Heavy Hitters (slides)
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Longest Paths in Graphs: Parameterized Algorithms
Two Families Theorem: A Few Combinatorial Applications (slides). Representative SET Computation (slides)
Thursday, May 25
10:00 – 11:00
10:00 – 11:00
Lecture: Algorithms for High-Dimensional Data
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Lecture: Longest Paths in Graphs: Parameterized Algorithms
12:30 – 14:00
12:30 – 14:00
Lunch
14:00 – 19:00
14:00 – 19:00
19:00 – 21:00
19:00 – 21:00
Dinner
Friday, May 26
10:00 – 11:00
10:00 – 11:00
Lecture: Streaming Algorithms
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Lecture: Streaming Algorithms
12:30 – 14:30
12:30 – 14:30
Lunch
14:30 – 15:30
14:30 – 15:30
Lecture: Algorithms for High-Dimensional Data
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Lecture: Longest Paths in Graphs: Parameterized Algorithms
RAA SCHEDULE
Monday, May 22
12:30 – 14:30
12:30 – 14:30
Registration
14:30 – 15:30
14:30 – 15:30
Graph Algorithms and Continuous Optimization
Part I: Overview (slides)
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Graph Algorithms and Continuous Optimization
Part 2: Unconstrained Minimization (notes and blackboard notes)
Tuesday, May 23
10:00 – 11:00
10:00 – 11:00
Graph Algorithms and Continuous Optimization
Part 3: Fast (Laplacian) Linear System Solving (notes and blackboard notes)
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Algorithms for High-Dimensional Data. Introduction (slides pdf pptx)
12:30 – 14:30
12:30 – 14:30
Lunch
14:30 – 15:30
14:30 – 15:30
Streaming Algorithms
Lecture 1: Distinct Elements and Frequency Moments in Data Streams (slides)
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Longest Paths in Graphs: Parameterized Algorithms
Lecture I: Basics of Parameterized Algorithms, Long Path in 80's and Representative Sets (slides and exercise)
Wednesday, May 24
10:00 – 11:00
10:00 – 11:00
Lecture: Graph Algorithms and Continuous Optimization (blackboard notes)
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Algorithms for High-Dimensional Data
Chapter 1: Dimension Reduction (slides pdf pptx)
12:30 – 14:30
12:30 – 14:30
Lunch
14:30 – 15:30
14:30 – 15:30
Lecture 1: Distinct Elements and Frequency Moments in Data Streams (slides)
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Longest Paths in Graphs: Parameterized Algorithms
Two Families Theorem: A Few Combinatorial Applications (slides). Representative SET Computation (slides)
Thursday, May 25
10:00 – 11:00
10:00 – 11:00
Lecture: Algorithms for High-Dimensional Data
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Lecture: Longest Paths in Graphs: Parameterized Algorithms
12:30 – 14:00
12:30 – 14:00
Lunch
14:00 – 19:00
14:00 – 19:00
19:00 – 21:00
19:00 – 21:00
Dinner
Friday, May 26
10:00 – 11:00
10:00 – 11:00
Lecture: Streaming Algorithms
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Lecture: Streaming Algorithms
12:30 – 14:30
12:30 – 14:30
Lunch
14:30 – 15:30
14:30 – 15:30
Lecture: Algorithms for High-Dimensional Data
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Lecture: Longest Paths in Graphs: Parameterized Algorithms
ORGANIZERS AND SPONSORS
Made on
Tilda