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.
Graph Algorithms and Continuous Optimization Part I: Overview (slides and video)
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, blackboard notes and video)
Tuesday, May 23
10:00 – 11:00
10:00 – 11:00
Graph Algorithms and Continuous Optimization Part 3: Fast (Laplacian) Linear System Solving (notes, blackboard notes and video)
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Algorithms for High-Dimensional Data Lecture 1: Introduction and Measure Concentration (slides pdfpptx and video)
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 and video)
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, exercise and video)
Algorithms for High-Dimensional Data Lecture 2: Dimension Reduction (slides pdfpptx and video)
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 and video)
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 and video)
Thursday, May 25
10:00 – 11:00
10:00 – 11:00
Algorithms for High-Dimensional Data Lecture 3: Theory of Nearest Neighbor Search (slides pdfpptx and video)
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Longest Paths in Graphs: 90's and 00's (slides pdfpptx and video)
Streaming Algorithms Lecture 4: Spectral sparsification in dynamic streams (slides and video)
12:30 – 14:30
12:30 – 14:30
Lunch
14:30 – 15:30
14:30 – 15:30
Algorithms for High-Dimensional Data Lecture 4: Practice of Nearest Neighbor Search (slides pdfpptm and video)
15:30 – 16:00
15:30 – 16:00
Coffee break
16:00 – 17:00
16:00 – 17:00
Longest Paths in Graphs: Parameterized Algorithms Algebraic-Technique (slides and video)
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 and video)
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, blackboard notes and video)
Tuesday, May 23
10:00 – 11:00
10:00 – 11:00
Graph Algorithms and Continuous Optimization Part 3: Fast (Laplacian) Linear System Solving (notes, blackboard notes and video)
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Algorithms for High-Dimensional Data Lecture 1: Introduction and Measure Concentration (slides pdfpptx and video)
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 and video)
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, exercise and video)
Algorithms for High-Dimensional Data Lecture 2: Dimension Reduction (slides pdfpptx and video)
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 and video)
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 and video)
Thursday, May 25
10:00 – 11:00
10:00 – 11:00
Algorithms for High-Dimensional Data Lecture 3: Theory of Nearest Neighbor Search (slides pdfpptx and video)
11:00 – 11:30
11:00 – 11:30
Coffee break
11:30 – 12:30
11:30 – 12:30
Longest Paths in Graphs: 90's and 00's (slides pdfpptx and video)