Curriculum Vitae
Education and Research Experience
MIT CSAIL
Graduate student · Advisor: Prof. Richard Ryan Williams · Cambridge, MA, USA
Tsinghua University
B.Eng. · Institute for Interdisciplinary Information Sciences (Yao Class) · Beijing, China
NTT Research
Research intern · Advisor: Abhishek Jain · Sunnyvale, CA, USA
Shanghai Qi Zhi Institute
Research intern · Advisor: Yilei Chen · Computational complexity of explicit constructions
University of Warwick
Research intern · Advisor: Igor C. Oliveira · Unprovability of complexity lower bounds
Research Interests
- Computational complexity — with an emphasis on circuit lower bounds.
- Proof complexity — and the meta-mathematics of complexity theory.
- Cryptography — and its connections to complexity theory.
Publications
By default, all authors contribute equally and are listed alphabetically; co-author names link to their homepages.
Conference Papers
Journal Articles
Manuscripts
On the Time Complexity of Feasible Proofs
Jiatu Li
Overcoming Padding in Cryptography via the Hardness of Certifying Random Strings
Yao-Ching Hsieh, Abhishek Jain, Jiatu Li, Surya Mathialagan
Awards and Fellowships
Jane Street Graduate Research Fellowship
Honorable Mention
Danny Lewin Best Student Paper Award
STOC 2022
Yao Award, 1st Prize (1/62)
IIIS, Tsinghua University
Selected Academic Talks
Yao’s Lemma Is All You Need (for Derandomization)
CMU Theory Lunch
Can We Find an Empty Pigeonhole Efficiently?
CMU Crypto Seminar
Teaching
18.405 Advanced Complexity Theory
Teaching Assistant · MIT
6.1400 Automata, Computability, and Complexity Theory
Teaching Assistant · MIT
Reading Group on Bounded Arithmetic
Organizer · MIT
Teaching Assistant · Tsinghua University
Professional Service
- Conference reviewing: CCC (2022, 2024, 2025), STOC (2024, 2025), FOCS (2024, 2025, 2026), ITCS (2025, 2026).
- Journal reviewing: Forum of Mathematics, Sigma.