I am a second-year Ph.D student in the theory group of UC Berkeley, where I’m very lucky to be advised by Venkatesan Guruswami.
I have a broad interest in theoretical computer science, especially in Computational Complexity and Hardness of Approximation.
During my undergrad, I was fortunate to work with Prof. Bingkai Lin on Parameterized Inapproximability, with Prof. Huacheng Yu on Sketching Complexity, and with Prof. Pinyan Lu on Algorithms with Predictions.
Email: xuandi_ren@berkeley.edu
PhD in Computer Science, 2022-now
University of California, Berkeley
BSc in Computer Science, 2018-2022
Turing Class, School of EECS, Peking University