Teaching:

2021-2022

CSE 200, Computational Complexity, Fall 2021
CSE 209, Theory seminar, Fall 2021
CSE 105, Theory of Computation, Winter 2022

2020-2021

CSE 20, Discrete Math for CS, Fall 2020
CSE 209A, Theory seminar, Winter 2021
CSE 291G, Expander graphs and high-dimensional expanders, Spring 2021

2019-2020

CSE 105, Theory of Computation, Fall 2019
CSE 200, Computational Complexity, Winter 2020
CSE 209A, Theory seminar, Winter 2020

2018-2019

CSE 209A, Theory seminar, Winter 2019
CSE 291, Communication Complexity, Winter 2019
CSE 105, Theory of Computation, Spring 2019

2017-2018

CSE 105, Theory of Computation, Fall 2017
CSE 209A, Theory seminar, Fall 2017
CSE 200, Computational Complexity, Winter 2018

2016-2017

CSE 20, Discrete mathematics, Fall 2016
CSE 209A, Theory seminar, Winter 2017
CSE 291, Fourier analysis of boolean functions (topics class), Winter 2017

2015-2016

CSE 20, Discrete mathematics, Fall 2015
CSE 209A, Theory seminar, Winter 2016
CSE 291, Advanced techniques in algorithm design (topics class), Spring 2016

2014-2015

CSE 290, Recent advances in theory (topics seminar), Fall 2014
CSE 20, Discrete mathematics, Winter 2015
CSE 190, Great ideas in algorithms (topics class), Spring 2015
CSE 209A, Theory seminar, Spring 2015

2013-2014

CSE 290, Seminar on Pseudorandomness (topics seminar), Fall 2013
MATH 15A, Discrete Mathematics, Winter 2014
CSE 291, Additive Combinatorics and its Applications (topics class), Winter 2014
CSE 290, Subexponential Algorithms for Factoring and Discrete Logarithm (topics class), Spring 2014
CSE 209A, Theory seminar, Spring 2014

2012-2013

CSE 20 Discrete Mathematics, Winter 2013
CSE 200, Computability and Complexity, Spring 2013