| 01 | 9/6 | Model of Computation [PDF] [TEX] | Jeff Kinne |
| 02 | 9/8 | Universality [PDF] [TEX] | Aaron Gorenstein |
| 03 | 9/13 | Reductions and Completeness [PDF] [TEX] | Brian Nixon |
| 04 | 9/15 | NP-Completeness [PDF] [TEX] | Ozcan Ilikhan |
| 05 | 9/22 | Time-bounded Nondeterminism [PDF] [TEX] | Gautam Prakriya |
| 06 | 9/27 | Space-bounded Nondeterminism [PDF] [TEX] | Prathmesh Prabhu |
| 07 | 9/29 | The Polynomial-Time Hierarchy [PDF] [TEX] | Xi Wu |
| 08 | 10/4 | Alternation [PDF] [TEX] | Sachin Ravi |
| 09 | 10/6 | Nonuniformity [PDF] [TEX] | David Guild |
| 10 | 10/11 | Circuit Lower Bounds [PDF] [TEX] | Li-Hsiang Kuo |
| 11 | 10/13 | Polynomial Approximation Method [PDF] [TEX] | Chetan Rao |
| 12 | 10/18 | Parallelism [PDF] [TEX] | Wenfei Wu |
| 13 | 10/20 | Randomness [PDF] [TEX] | Brian Nixon |
| 14 | 10/25 | Randomized Classes [PDF] [TEX] | David Guild |
| 15 | 10/27 | Expanders [PDF] [TEX] | Li-Hsiang Kuo |
| 16 | 11/1 | Error Reduction [PDF] [TEX] | Aaron Gorenstein |
| 17 | 11/3 | Space-Bounded Derandomization [PDF] [TEX] | Chetan Rao |
| 18 | 11/8 | Pseudorandomness [PDF] [TEX] | Sachin Ravi |
| 19 | 11/10 | Time-Bounded Derandomization [PDF] [TEX] | Ozcan Ilikhan |
| 20 | 11/15 | Error Correcting Codes [PDF] [TEX] | Xi Wu |
| 21 | 11/17 | Worst-Case to Average-Case Reductions [PDF] [TEX] | Gautam Prakriya |
| 22 | 11/22 | Randomness Extractors [PDF] [TEX] | Prathmesh Prabhu |
| 23 | 11/29 | Counting [PDF] [TEX] | Li-Hsiang Kuo |
| 24 | 12/1 | Approximate Counting [PDF] [TEX] | David Guild & Gautam Prakriya |
| 25 | 12/6 | Counting versus Alternation [PDF] [TEX] | Brian Nixon & Sachin Ravi |
| 26 | 12/8 | Arthur-Merlin Games [PDF] [TEX] | Aaron Gorenstein & Chetan Rao |
| 27 | 12/13 | Interactive Proofs [PDF] [TEX] | Xi Wu & Prathmesh Prabhu |
| 28 | 12/15 | Probabilistically Checkable Proofs | Wenfei Wu |
