I am a PhD student with the Theory of Computation group at UC Berkeley, where I am advised by Shafi Goldwasser and Avishay Tal. Before, I completed my MSc at the Weizmann Institute of Science, advised by Oded Goldreich.
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.
My pronouns are he/him.
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!