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.

Pronouns: he/him.

Probabilistically checkable proofs (PCPs) can be verified based only on a constant amount of random queries, such that any correct …

Probabilistically checkable proofs (PCPs) can be verified based only on a constant amount of random queries, such that any correct …

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!*

- CS294-92 Analysis of Boolean Functions

Spring 2020 at UC Berkeley.

Office hours: Wednesdays 2:30-3:30pm or by appointment. Soda Hall, room 626.

- A Mini-Course on Probabilisitcally Checkable Proofs

*2018 Amos de-Shalit Summer School*at the Weizmann Institute of Science.

- Introduction to Property Testing

Fall 2018 at the Weizmann Institute of Science. - Student led reading of
*Computational Complexity*

Fall 2018 at the Weizmann Institute of Science.