Computer Science II (2026)
Computer Science II (Fall 2026)
Graduate-level course on advanced algorithms, Fall 2026
Scribing
As a part of course requirement, each of the students will have to make notes for one of the lecture. The students are allowed to use LLMs to assist with this task. The notes where LLM were used to assist with writing will be accompanied with a disclaimer.
Use this template for your notes.
Please submit the notes within few days from the lecture (no later than a week after the lecture), including the LaTeX source, and the BibTeX file if necessary.
Lectures
Lectures take place in Classroom 101, via Sarfatti 25. The slides are generated using LLMs based on my own notes.
- Lecture 1, Monday, August 31st, 2026 (10:15 - 11:45): Polynomial Identity Testing slides notes
- Lecture 2, Tuesday, September 1st, 2026 (10:15 - 11:45): Integer Multiplication and Fast Fourier Transform slides notes
- Lecture 3, Thursday, September 3rd, 2026 (16:30 - 18:00): Power method slides notes
- Lecture 4, Monday, September 7th, 2026 (10:15 - 11:45): Cheeger’s inequality slides notes
- Lecture 5, Tuesday, September 8th, 2026 (14:45 - 16:16): Undirected st-connectivity in logspace slides notes
- Lecture 6, Thursday, September 10th, 2026 (16:30 - 18:00): Planted clique problem slides notes
- Lecture 7, Monday, September 14th, 2026 (10:15 - 11:45): Johnson-Lindenstrauss Dimensionality Reduction slides notes
- Lecture 8, Thursday, September 27th, 2026 (16:30 - 18:00): Linear Programming, Sparsest Cut, and Metric Embeddings slides notes
- Lecture 9, Monday, September 21st, 2026 (10:15 - 11:45): Semidefinite Programming, Max Cut slides notes
- Lecture 10, Monday, September 21st, 2026 (14:45 - 16:15): Robust Mean Estimation slides notes
- Lecture 11, Thursday, September 24th, 2026 (16:30 - 18:00): Error-Correcting Codes and List Decoding slides
- Lecture 12, Monday, September 28th, 2026 (14:45 - 16:15): Hardness vs. Randomness (Derandomization) slides notes