| 2026 | EuroCrypt | Lower Bounds on the Overhead of Indistinguishability Obfuscation. | Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass |
| 2026 | ICALP | Equivalence Between Coding and Complexity Lower Bounds. | Jinqiao Hu, Zhenjian Lu, Igor C. Oliveira |
| 2024 | FOCS | Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. | Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima |
| 2024 | FOCS | On the Complexity of Avoiding Heavy Elements. | Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2024 | ICALP | Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity. | Zhenjian Lu, Rahul Santhanam |
| 2024 | TCC | One-Way Functions and pKt Complexity. | Shuichi Hirahara, Zhenjian Lu, Igor C. Oliveira |
| 2023 | FOCS | Polynomial-Time Pseudodeterministic Construction of Primes. | Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2023 | STOC | A Duality between One-Way Functions and Average-Case Symmetry of Information. | Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira |
| 2022 | ICALP | Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. | Zhenjian Lu, Igor C. Oliveira, Marius Zimand |
| 2021 | ICALP | Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. | Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira |
| 2021 | ICALP | An Efficient Coding Theorem via Probabilistic Representations and Its Applications. | Zhenjian Lu, Igor C. Oliveira |
| 2021 | STOC | Pseudodeterministic algorithms and the structure of probabilistic time. | Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam |
| 2019 | ICALP | Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. | Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis |
| 2017 | STOC | A polynomial restriction lemma with applications. | Valentine Kabanets, Daniel M. Kane, Zhenjian Lu |