Recent Course Offerings

Fall 2024

• Fair AI for Multi-Agent Decision Making — Arpita Biswas.

Spring 2024

• Expanders and High-dimensional Expanders — Siqi Liu.

Fall 2023

• Information-theoretic Methods in Complexity Theory — Sumegha Garg.
• Network and Combinatorial Optimization — Peng Zhang.
• Linear Programming and its Application to Approximation Algorithms — Karthik C. S..
• Advanced Algorithms I — Aaron Bernstein.
• Combinatorics I — Jeff Kahn.

Spring 2023

• Advanced Algorithms II: Spectral Graph Algorithms — Peng Zhang.
• Advanced Algorithms I — Aaron Bernstein.
• Combinatorics II — Jeff Kahn.

Fall 2022

• Linear Programming — Sepehr Assadi.
• Complexity of Computation — Karthik C.S..
• Advanced Algorithms I — Jie Gao.
• Combinatorics I — Bhargav Narayanan.

Spring 2022

• Derandomization and Its Connections Throughout Complexity Theory — Roei Tell.

Fall 2021

• Advanced Algorithms I — Martín Farach-Colton.
• Advanced Algorithms II: Sublinear Algorithms — Sepehr Assadi.
• Discrepancy Theory and Its Applications — Peng Zhang.
• Economics and Computation — Dave Pennock and Ariel Schvartzman.
• Extremal Combinatorics — Jeff Kahn.
• Interplay of Geometry and Computation — Karthik C. S..

Spring 2021

• Advanced Algorithms I — Jie Gao.
• Quantum Computing — Mario Szegedy.
• Combinatorics II — Jeff Kahn.

Fall 2020

• Advanced Algorithms I — Aaron Bernstein.
• Advanced Algorithms II: Data Structure Upper and Lower Bounds — Martín Farach-Colton.
• Linear Programming — Bahman Kalantari.
• Graph Streaming Algorithms and Lower Bounds — Sepehr Assadi.
• Algorithmic Number Theory — Swastik Kopparty.
• Combinatorics I — Jeff Kahn.

Spring 2020

• Advanced Algorithms I — Jie Gao.
• Advanced Algorithms II: Sublinear Algorithms — Sepehr Assadi.
• Advanced Topics in Algorithms and Complexity — Swastik Kopparty.
• Graph Theory — Shubhangi Saraf.
• Probabilistic Methods — Jeff Kahn.
• Combinatorics II — Bhargav Narayanan.

Fall 2019

• Advanced Algorithms I — Martín Farach-Colton.
• Computational Complexity — Shubhangi Saraf.
• Computational Geometry — William Steiger.
• Combinatorics I — Jeff Kahn.
• Topics in Finite Fields — Swastik Kopparty.

Spring 2019

• Advanced Algorithms I — Aaron Bernstein.
• Topics in Combinatorics — Bhargav Narayanan.
• Graph Theory — Jeff Kahn.

Fall 2018

• Advanced Algorithms I — Martín Farach-Colton.
• Linear Programming — Bahman Kalantari.
• Combinatorics I — József Beck.

Spring 2018

• Advanced Algorithms I — Mina Ghashami and Matthäus Kleindessner.
• Advanced Algorithms II — Shan Muthukrishnan.
• Computational Geometry — William Steiger.
• Topics in Pseudorandomness and Complexity — Swastik Kopparty.
• Algebraic Gems in Discrete Mathematics and Theoretical Computer Science — Shubhangi Saraf.
• Graph Theory — Bhargav Narayanan.
• Combinatorics II — József Beck.

Fall 2017

• Advanced Algorithms I — Martín Farach-Colton.
• Linear Programming — Bahman Kalantari.
• Computational Complexity — Shubhangi Saraf.
• Cryptography — David Cash.
• Theoretical Machine Learning — Pranjal Awasthi.
• Combinatorics I — Swastik Kopparty.
• Extremal Combinatorics — Jeff Kahn.

Spring 2017

• Advanced Algorithms I — Mario Szegedy.
• Advanced Algorithms II — Martín Farach-Colton.
• Computational Geometry — William Steiger.
• Topics in Psuedorandomness and Complexity — Swastik Kopparty.
• Graph Theory — József Beck.
• Combinatorics II — Shubhangi Saraf.
• Probabilistic Methods — Jeff Kahn.

Fall 2016

• Advanced Algorithms I — Shubhangi Saraf.
• Linear Programming — Bahman Kalantari.
• Complexity of Computation — Mario Szegedy.
• Theoretical Machine Learning — Pranjal Awasthi.
• Combinatorics I — Jeff Kahn.
• Arithmetic Combinatorics — Swastik Kopparty.