IEEE Annual Symposium on Foundations of Computer Science · 2023
Cited
14
Resume (English only)
Academic Achievements
Published papers include 'Polynomial-Time Pseudodeterministic Construction of Primes' and more. Organized several workshops including the explicit construction workshop at FOCS23.
Research Experience
Currently an Assistant Professor at UC Berkeley, previously a Miller Research Fellow there, hosted by Avishay Tal and Umesh V. Vazirani. During the Spring of 2016, visited MIT, working under the supervision of Prof. Scott Aaronson.
Education
Ph.D. from MIT, advised by Ryan Williams; Bachelor's degree from the Institute for Interdisciplinary Information Sciences at Tsinghua University, advised by Prof. Jian Li.
Background
Research Interests: Broad interest in theoretical computer science, especially in fundamental questions in complexity theory, and also in applying the ideas of theoretical computer science to other scientific fields such as quantum physics and AI safety. Briefly: Assistant Professor at the Department of Electrical Engineering and Computer Sciences at UC Berkeley.
Miscellany
Teaching CS 278: Computational Complexity Theory this Fall!