| Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness IC Oliveira, R Santhanam Computational Complexity Conference (CCC), 2017 | 61 | 2017 |
| Hardness Magnification for Natural Problems IC Oliveira, R Santhanam Symposium on Foundations of Computer Science (FOCS), 2018 | 49 | 2018 |
| Hardness magnification near state-of-the-art lower bounds IC Oliveira, J Pich, R Santhanam Computational Complexity Conference (CCC) & Theory of Computing (ToC), 2019 | 43 | 2019 |
| Learning circuits with few negations E Blais, C Canonne, IC Oliveira, R Servedio, LY Tan International Workshop on Randomization and Computation (RANDOM), 2015 | 41 | 2015 |
| NP-hardness of circuit minimization for multi-output functions R Ilango, B Loff, IC Oliveira Computational Complexity Conference (CCC), 2020 | 37 | 2020 |
| The Power of Negations in Cryptography S Guo, IC Oliveira, T Malkin, A Rosen Theory of Cryptography Conference (TCC), 2015 | 34 | 2015 |
| Beyond natural proofs: hardness magnification and locality L Chen, S Hirahara, IC Oliveira, J Pich, N Rajgopal, R Santhanam Journal of the ACM (JACM) & Innovations in Theoretical Computer Science (ITCS), 2020 | 32 | 2020 |
| Pseudodeterministic constructions in subexponential time IC Oliveira, R Santhanam Symposium on Theory of Computing (STOC), 2017 | 31 | 2017 |
| Algorithms versus circuit lower bounds IC Oliveira Electronic Colloquium on Computational Complexity (ECCC) - TR13-117, 2013 | 31 | 2013 |
| NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD circuits S Hirahara, IC Oliveira, R Santhanam Computational Complexity Conference (CCC), 2018 | 29 | 2018 |
| Constructing hard functions from learning algorithms A Klivans, P Kothari, IC Oliveira Conference on Computational Complexity (CCC), 2013 | 29* | 2013 |
| Near-optimal small-depth lower bounds for small-distance connectivity X Chen, IC Oliveira, R Servedio, LY Tan Symposium on Theory of Computing (STOC), 2016 | 27 | 2016 |
| Randomness and intractability in Kolmogorov complexity IC Oliveira International Colloquium on Automata, Languages and Programming (ICALP), 2019 | 18 | 2019 |
| Unconditional lower bounds in complexity theory IC Oliveira Columbia University (PhD Thesis), 2015 | 15 | 2015 |
| Erdos-Ko-Rado in random hypergraphs: asymptotics and stability MM Gauy, H Han, IC Oliveira Combinatorics, Probability and Computing (CPC) 26 (3), 406-422, 2017 | 14 | 2017 |
| Algorithms and lower bounds for de Morgan formulas of low-communication leaf gates V Kabanets, S Koroth, Z Lu, D Myrisiotis, IC Oliveira Computational Complexity Conference (CCC) & ACM Trans. Comput. Theory (ToCT), 2020 | 12 | 2020 |
| Pseudo-derandomizing learning and approximation IC Oliveira, R Santhanam International Conference on Randomization and Computation (RANDOM), 2018 | 12 | 2018 |
| Addition is exponentially harder than counting for shallow monotone circuits X Chen, IC Oliveira, R Servedio Symposium on the Theory of Computing (STOC), 2017 | 12 | 2017 |
| An average-case lower bound against ACC R Chen, IC Oliveira, R Santhanam Latin American Symposium on Theoretical Informatics (LATIN), 2018 | 11* | 2018 |
| Parity helps to compute Majority IC Oliveira, R Santhanam, S Srinivasan Computational Complexity Conference (CCC), 2019 | 10 | 2019 |
