Scholar
Yuhao Li
Google Scholar ID: VBjlDboAAAAJ
Columbia University
Citations & Impact
Citations
127
H-index
7
i10-index
4
Publications
18
Co-authors
0
Contact
Publications
Resume (English only)
Academic Achievements
- Gave talks at theory seminars at Rutgers, UPenn, CMU, Columbia, and MIT in Oct 2025.
- Paper 'Constant Inapproximability of Pacing Equilibria in Second-Price Auctions' accepted to WINE 2025.
- Paper 'Reducing Tarski to Unique Tarski (in the Black-box Model)' accepted by SICOMP.
- Presented 'Metamathematics of Resolution Lower Bounds: A TFNP Perspective' at STOC 2025 TFNP Workshop.
- Two papers accepted to EC 2025.
- Paper 'Computing a Fixed Point of Contraction Maps in Polynomial Queries' invited to HALG 2025 and accepted by JACM.
- Multiple papers accepted to ITCS 2024, SODA 2024, and other conferences in 2024.
- Paper 'MEV Makes Everyone Happy under Greedy Sequencing Rule' accepted to CCS DeFi 2023.
Research Experience
- Engaged in multiple research projects during his Ph.D. studies at Columbia University, covering areas such as complexity theory and game theory.
Education
- Received B.Sc. degree in Computer Science from Peking University, advised by Prof. Xiaotie Deng; currently a fifth-year Ph.D. student in the theory group at Columbia University, advised by Prof. Xi Chen and Prof. Rocco Servedio. Also collaborating closely with Prof. Toniann Pitassi and Prof. Mihalis Yannakakis.
Background
- Broadly interested in theoretical computer science and discrete mathematics, including complexity theory (TFNP, proof complexity, communication complexity), game theory, logic and automata theory, and combinatorics.
Co-authors