| 2026 | STOC | The Weak Rank Principle: Lower Bounds and Applications. | Michal Garlk, Svyatoslav Gryaznov, Hanlin Ren, Iddo Tzameret |
| 2026 | STOC | Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds. | Jiawei Li, Yuhao Li, Hanlin Ren |
| 2024 | FOCS | On the Complexity of Avoiding Heavy Elements. | Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2024 | STOC | Symmetric Exponential Time Requires Near-Maximum Circuit Size. | Lijie Chen, Shuichi Hirahara, Hanlin Ren |
| 2023 | FOCS | Polynomial-Time Pseudodeterministic Construction of Primes. | Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2023 | STOC | Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms. | Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren |
| 2023 | STOC | NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. | Yizhi Huang, Rahul Ilango, Hanlin Ren |
| 2022 | FOCS | On the Range Avoidance Problem for Circuits. | Hanlin Ren, Rahul Santhanam, Zhikun Wang |
| 2022 | STOC | Maintaining exact distances under multiple edge failures. | Ran Duan, Hanlin Ren |
| 2022 | STOC | Robustness of average-case meta-complexity via pseudorandomness. | Rahul Ilango, Hanlin Ren, Rahul Santhanam |
| 2022 | STACS | A Relativization Perspective on Meta-Complexity. | Hanlin Ren, Rahul Santhanam |
| 2021 | ICALP | Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time. | Yong Gu, Hanlin Ren |
| 2021 | SODA | Approximate Distance Oracles Subject to Multiple Vertex Failures. | Ran Duan, Yong Gu, Hanlin Ren |
| 2020 | ESA | Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. | Hanlin Ren |
| 2020 | STOC | Strong average-case lower bounds from non-trivial derandomization. | Lijie Chen, Hanlin Ren |
| 2018 | ICALP | Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time. | Ran Duan, Hanlin Ren |