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.

Ed

We will use Ed for course discussion. The link is: https://edstem.org/us/courses/85871/discussion. If you are enrolled in the course, you should have access to Ed. Please email the instructor if you cannot access Ed.

Homework

Homeworks will be posted below when they become available. Here is a LaTeX template you may use for the homework, and here is a short guide to LaTeX. Feel free to visit office hours for help installing/setting up LaTeX. Please submit your solutions to Gradescope: https://www.gradescope.com/courses/1114749.

Lecture notes and schedule

For most lectures, we will use lecture notes from previous iterations. Below is a tentative schedule.

Lecture #DateTopicLecture notes
Randomized Algorithms
19/3Randomized Min-CutLecture 1
29/8Concentration InequalitiesLecture 2
39/10Hashing ILecture 3
49/15Hashing IILecture 4
59/17Locality-Sensitive Hashing and Approximate Nearest NeighborsLecture 5
69/22Streaming ILecture 6
79/24Streaming II
89/29Dimension Reduction and Johnson-Lindenstrauss Lemma
Linear Programming & Semidefinite Programming
910/1LP Duality
1010/6LP Rounding
1110/8Simplex Algorithm
10/13Fall Break
10/15Fall Break
1210/20Ellipsoid Algorithm
1310/22Semidefinite Programming
1410/27Submodular Minimization
Other Algorithmic Topics
1510/29Online Algorithms
1611/3Parameterized Complexity
1711/5Coding Theory
1811/10Distance Oracles
1911/12Graph Spanners
2011/17Graph Sparsifiers
2111/19Low-Rank Approximations and SVD
2211/24External Memory Algorithms
11/26Thanksgiving
Project Presentations
2312/1Project Presentations
2412/3Project Presentations