| 2026 | STOC | A Theory for Probabilistic Polynomial-Time Reasoning. | Lijie Chen, Jiatu Li, Igor C. Oliveira, Ryan Williams |
| 2026 | STOC | SNARGs for NP from Unprovability of Mathematical Theorems (Or: How to Use the Simplicity of Cryptographic Reasoning). | Yao-Ching Hsieh, Abhishek Jain, Jiatu Li, Surya Mathialagan |
| 2025 | STOC | Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin. | Lijie Chen, Jiatu Li, Jingxun Liang |
| 2025 | STOC | The Structure of Catalytic Space: Capturing Randomness and Time via Compression. | James Cook, Jiatu Li, Ian Mertz, Edward Pyne |
| 2024 | FOCS | Reverse Mathematics of Complexity Lower Bounds. | Lijie Chen, Jiatu Li, Igor C. Oliveira |
| 2024 | FOCS | Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. | Jiatu Li, Edward Pyne, Roei Tell |
| 2024 | STOC | Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. | Yilei Chen, Jiatu Li |
| 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 | Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. | Rahul Ilango, Jiatu Li, R. Ryan Williams |
| 2023 | STOC | Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. | Jiatu Li, Igor C. Oliveira |
| 2022 | STOC | The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. | Zhiyuan Fan, Jiatu Li, Tianqi Yang |
| 2022 | STOC | 3.1 | Jiatu Li, Tianqi Yang |