I am a first-year PhD student with the Theory of Computation group at UC Berkeley.
I’m generally interested in theoretical computer science, and in particular computational complexity. I’ve been working on probabilistically checkable proofs and their connections with other areas of complexity theory. I’m also interested in societal aspects of theoretical computer science.
About research other than my own
Slides and notes aren’t always identitcal to what was taught in class, and may be too elaborate/terse or contain my own original errors. If you encounter the latter, please let me know. Thank you!