| 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 |
| 2026 | STOC | A Theory for Probabilistic Polynomial-Time Reasoning. | Lijie Chen, Jiatu Li, Igor C. Oliveira, Ryan Williams |
| 2026 | STOC | Failure of Symmetry of Information for Randomized Computations. | Jinqiao Hu, Yahel Manor, Igor C. Oliveira |
| 2024 | FOCS | Reverse Mathematics of Complexity Lower Bounds. | Lijie Chen, Jiatu Li, Igor C. Oliveira |
| 2024 | FOCS | On the Complexity of Avoiding Heavy Elements. | Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2024 | STACS | Polynomial-Time Pseudodeterministic Constructions (Invited Talk). | Igor C. Oliveira |
| 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 |
| 2023 | STOC | Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. | Jiatu Li, Igor C. Oliveira |
| 2022 | ICALP | Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. | Zhenjian Lu, Igor C. Oliveira, Marius Zimand |
| 2021 | FOCS | Quantum learning algorithms imply circuit lower bounds. | Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram |
| 2021 | FOCS | LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. | Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira |
| 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 |
| 2018 | LATIN | An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0. | Ruiwen Chen, Igor C. Oliveira, Rahul Santhanam |
| 2017 | STOC | Addition is exponentially harder than counting for shallow monotone circuits. | Xi Chen, Igor C. Oliveira, Rocco A. Servedio |
| 2017 | STOC | Pseudodeterministic constructions in subexponential time. | Igor C. Oliveira, Rahul Santhanam |
| 2016 | STOC | Near-optimal small-depth lower bounds for small distance connectivity. | Xi Chen, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan |
| 2015 | TCC | The Power of Negations in Cryptography. | Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen |