I am a professor of Computer Science in the Computing and Mathematical Sciences department at Caltech, and a member of the Theory Group.
My research interests are in theoretical computer science, especially computational complexity. Specifically, I am interested in derandomization, explicit constructions, algebraic complexity and algorithms, and hardness of approximation.
I received my Ph.D. in Computer Science from Berkeley in 2000. From 2000-2002 I was a postdoc in the Theory Group at Microsoft Research. I joined Caltech in 2002.
Apply to Caltech:
- graduate studies (indicate "theory" as area of interest)
- postdoc and faculty positions
Some professional activities:
- Some recent program committees: FOCS 2024, RANDOM 2023, ITCS 2023, STOC 2021, SODA 2020, FOCS 2017 (chair) accepted papers, ITCS 2017, RANDOM 2016 (chair), STOC 2015, STOC 2014, CCC 2013 (chair)
- Vice-Chair, SIGACT.
- Member of the scientific board of ECCC.
- Editorial boards of Theory of Computing (ToC), ACM Transactions on Computation Theory (TOCT), and Computational Complexity (CC).
- a summary of my research, and online papers
- teaching, and course notes
- useful theory links
- other links