Courses
Graduate Courses
CS 860: Randomized Complexity Theory
Winter 2025
CS 764: Computational Complexity
Winter 2024
CS 860: Probabilistic Methods in Computer Science
Winter 2023
CS 860: Sublinear-Time Algorithms
Winter 2021, Fall 2014
CS 860: Concentration Inequalities in Computer Science
Winter 2020
CS 860: Communication Complexity
Winter 2019, 2016
CS 798: Analysis of Boolean Functions
Fall 2017
Undergraduate Courses
CS 365: Models of Computation
Winter 2025, 2024, 2023, 2021, 2020, 2019, 2017, 2015
CS 341: Algorithms
Fall 2019, Spring 2018
CS 466: Algorithm Design & Analysis
Fall 2017, 2016
CS 489: Complexity of Computational Problems
Winter 2016