- Spring 2023 Randomized algorithms (S. Oveis Gharan)
- Winter 2023 Analytic and geometric methods in TCS (J. R. Lee)
- Winter 2023 Lattices (Rothvoss)
- Fall 2022 Intro to Quantum Computing (J. R. Lee)
- Spring 2022 Lattices and Lattice-based Cryptography (Lin)
- Winter 2022 Intro to Quantum Computing (J. R. Lee)
- Winter 2022 Foundations of Fairness in Machine Learning (Jamie Morgenstern)
- Winter 2022 Modern Spectral Graph Theory (Oveis Gharan)
- Spring 2021 The art and science of positive definite matrices (J. R. Lee)
- Winter 2021 Sketching Algorithms (Y. T. Lee)
- Winter 2021 Cryptographic Protocols for Privacy-Preserving Computation (Tessaro)
- Winter 2021 Asymptotic Convex Geometry (Rothvoss)
- Fall 2020 Proof Complexity (Beame)
- Winter 2020 The Polynomial Paradigm in Algorithms (Shayan Oveis Gharan)
- Winter 2020 Foundations of Fairness in Machine Learning (Jamie Morgenstern)
- Fall 2019 Robustness in Machine Learning (Jerry Li)
- Fall 2019 Modern Coding Theory (Anup Rao)
- Spring 2019 Cryptography (Lin)
- Spring 2019 Randomized algorithms (J. Lee)
- Winter 2019 Probabilistic combinatorics (T. Rothvoss)
- Winter 2019 Theory of convex optimization (Y. T. Lee)
- Winter 2019 Communication complexity and lower bounds (A. Rao)
- Fall 2018 Algorithms through a geometric lens (I. Razenshteyn)
- Spring 2018 Competitive analysis via convex optimization (S. Bubeck and J. Lee)
- Winter 2018 Interplay between convex optimization and geometry (Y. T. Lee)
- Winter 2018 Student reading group - Lattices
- Fall 2017 Counting and sampling (Oveis Gharan)
- Spring 2017 Algorithms and uncertainty (Devanur and Karlin)
- Fall 2016 Randomized algorithms & probabilistic analysis (J. Lee)
- Spring 2016 Integer Optimization and Lattices (Rothvoss)
- Winter 2016 Entropy optimality (J. Lee)
- Fall 2015 Communication complexity (Rao)
- Spring 2015 Recent developments in approximation algorithms (Oveis Gharan)