Scholar
Hanlin Ren
Google Scholar ID: d7WVkWYAAAAJ
Institute for Advanced Study
computational complexity theory
graph algorithms
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
304
H-index
11
i10-index
12
Publications
18
Co-authors
0
Publications
7 items
Many Proof Complexity Generators Inside One Demi-Bits Generator
2026
Cited
0
The Weak Rank Principle: Lower Bounds and Applications
2026
Cited
0
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries
2026
Cited
0
Total Search Problems in $mathsf{ZPP}$
2025
Cited
0
Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
2025
Cited
0
New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
2025
Cited
0
Polynomial-Time Pseudodeterministic Construction of Primes
IEEE Annual Symposium on Foundations of Computer Science · 2023
Cited
14
