Instructor | Huacheng Yu |
Lectures | Monday/Wednesday 1:20-2:40pm |
TAs | Rohit Agarwal, Frederick Qiu |
Location | Friend Center 008 |
Office hours | Huacheng: M/W 2:45-3:45pm @ CS310 Rohit: T 1-2pm, Th 11am-noon @ CS 3rd floor common space Frederick: F 1:30-3:30pm @ CS 3rd floor common space |
For contact information, course description, collaboration/grading policy, etc., please see the course infosheet.
Lecture # | Date | Topic | Lecture notes |
---|---|---|---|
Randomized Algorithms | |||
1 | 9/3 | Randomized Min-Cut | Lecture 1 |
2 | 9/8 | Concentration Inequalities | Lecture 2 |
3 | 9/10 | Hashing I | Lecture 3 |
4 | 9/15 | Hashing II | Lecture 4 |
5 | 9/17 | Locality-Sensitive Hashing and Approximate Nearest Neighbors | Lecture 5 |
6 | 9/22 | Streaming I | Lecture 6 |
7 | 9/24 | Streaming II | |
8 | 9/29 | Dimension Reduction and Johnson-Lindenstrauss Lemma | |
Linear Programming & Semidefinite Programming | |||
9 | 10/1 | LP Duality | |
10 | 10/6 | LP Rounding | |
11 | 10/8 | Simplex Algorithm | |
10/13 | Fall Break | ||
10/15 | Fall Break | ||
12 | 10/20 | Ellipsoid Algorithm | |
13 | 10/22 | Semidefinite Programming | |
14 | 10/27 | Submodular Minimization | |
Other Algorithmic Topics | |||
15 | 10/29 | Online Algorithms | |
16 | 11/3 | Parameterized Complexity | |
17 | 11/5 | Coding Theory | |
18 | 11/10 | Distance Oracles | |
19 | 11/12 | Graph Spanners | |
20 | 11/17 | Graph Sparsifiers | |
21 | 11/19 | Low-Rank Approximations and SVD | |
22 | 11/24 | External Memory Algorithms | |
11/26 | Thanksgiving | ||
Project Presentations | |||
23 | 12/1 | Project Presentations | |
24 | 12/3 | Project Presentations |