# Courses

### Current/upcoming

### Past

- [CSS.203.1] Computational Complexity (2024-I)
- [CSS.413.1] Pseudorandomness (2023-II)
- [CSS.203.1] Computational Complexity (2023-I)
- [CSS.410.1] Topics in algebraic geometry (reading course) (2023-I) (co-teaching with Mrinal Kumar)
- [CSS.307.1] Algebra and Computation
- [CSS.413.1] Pseudorandomness (2021-II) (co-taught with Prahladh Harsha)
- [CSS.203.1] Complexity Theory (2021-I) (co-taught with Prahladh Harsha)
- [CSS.324.1] Analysis of Boolean Functions (2020-II)
- Algebra and Computation: A reading course (2020-I)
- Reading/watching Group on Complexity
- Cryptography (2019-II)
- Algebra and Computation (2019-I)
- Pseudorandomness (2018-II)
- Reading course, following “Ideals, Varieties and Algorithms” by Cox, Little and O’Shea.
- Algebraic Circuit Complexity (2017-II)
- Algebra and Computation (2017-I)