You can download the lecture notes here.
|
Lecture # |
Date |
Title |
Download |
|
Lecture 1 |
Feb 1 |
Introduction (Course overview,
Randomized algorithms) |
|
|
The Power of Randomness |
|||
|
Lecture 2 |
Feb 6 |
Randomized Algorithms and Complexity
Classes |
|
|
Lecture 3 |
Feb 8 |
Sampling and Approximation Problems |
|
|
Lecture 4 |
Feb 13 |
Random Walks |
|
|
Basic Derandomization Techniques |
|||
|
Lecture 5 |
Feb 15 |
Basic Derandomization Techniques |
|
|
Lecture 6 |
Feb 20 |
Basic Derandomization Techniques II |
|
|
Expander Graphs |
|||
|
Lecture 7 |
Feb 27 |
Expander Graphs |
|
|
Lecture 8 |
Mar 1 |
Random Walk on Expanders |
|
|
Lecture 9 (Revised!) |
Mar 6,8 |
Explicit Constructions of Expanders
and Undirected S-T Connectivity in
Logspace |
|
|
Extractors |
|||
|
Lecture 10 |
Mar 13 |
Randomness Extractors |
|
|
Lecture 11 |
Mar 15 |
Extractor vs. Hashing and Expanders |
|
|
Lecture 12 |
Mar 20 |
Constructing Extractors |
|
|
Lecture 13 |
Mar 22 |
More Connections with Expander |
|
|
List-Decodable Error-Correcting Codes |
|||
|
Lecture 14 |
Apr 3 |
Error-Correcting Codes |
|
|
Lecture 15 (Updated!) |
Apr 5 |
List-Decoding Algorithms |
|
|
Lecture 16 |
Apr 12 |
List-Decodable Codes vs. Extractors
& Expanders |
|
|
Pseudorandom Generators |
|||
|
Lecture 17 |
Apr 10 |
Pseudorandom Generators |
|
|
Lecture 18 |
Apr 17 |
PRGs from Average-Case Hardness |
|
|
Lecture 19 |
Apr 19 |
Worst-case vs. Average-Case Hardness |
|
|
Lecture 20 |
Apr 24 |
Locally Decodable Codes |
|
|
Lecture 21 |
Apr 26 |
Local List-Decoding |
|
|
Lecture 22 |
May 1 |
Black-Box PRG Constructions and
Extractors |
|
|
Lecture 23 |
May 3 |
Conclusion and Beyond |
|