Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness IC Oliveira, R Santhanam Computational Complexity Conference (CCC), 2017 | 73 | 2017 |

Hardness Magnification for Natural Problems IC Oliveira, R Santhanam Symposium on Foundations of Computer Science (FOCS), 2018 | 59 | 2018 |

NP-hardness of circuit minimization for multi-output functions R Ilango, B Loff, IC Oliveira Computational Complexity Conference (CCC), 2020 | 51 | 2020 |

Hardness magnification near state-of-the-art lower bounds IC Oliveira, J Pich, R Santhanam Computational Complexity Conference (CCC) & Theory of Computing (ToC), 2019 | 50 | 2019 |

Learning circuits with few negations E Blais, C Canonne, IC Oliveira, R Servedio, LY Tan International Workshop on Randomization and Computation (RANDOM), 2015 | 45 | 2015 |

Pseudodeterministic constructions in subexponential time IC Oliveira, R Santhanam Symposium on Theory of Computing (STOC), 2017 | 42 | 2017 |

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 | 41 | 2020 |

NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD circuits S Hirahara, IC Oliveira, R Santhanam Computational Complexity Conference (CCC), 2018 | 37 | 2018 |

The Power of Negations in Cryptography S Guo, IC Oliveira, T Malkin, A Rosen Theory of Cryptography Conference (TCC), 2015 | 37 | 2015 |

Algorithms versus circuit lower bounds IC Oliveira Electronic Colloquium on Computational Complexity (ECCC) - TR13-117, 2013 | 33 | 2013 |

Constructing hard functions from learning algorithms A Klivans, P Kothari, IC Oliveira Conference on Computational Complexity (CCC), 2013 | 32* | 2013 |

Randomness and intractability in Kolmogorov complexity IC Oliveira International Colloquium on Automata, Languages and Programming (ICALP), 2019 | 28 | 2019 |

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 | 28 | 2016 |

Pseudodeterministic algorithms and the structure of probabilistic time Z Lu, IC Oliveira, R Santhanam Symposium on Theory of Computing (STOC), 2021 | 20 | 2021 |

Pseudo-derandomizing learning and approximation IC Oliveira, R Santhanam International Conference on Randomization and Computation (RANDOM), 2018 | 17 | 2018 |

Probabilistic Kolmogorov complexity with applications to average-case complexity H Goldberg, V Kabanets, Z Lu, IC Oliveira Computational Complexity Conference (CCC), 2022 | 16 | 2022 |

Parity helps to compute Majority IC Oliveira, R Santhanam, S Srinivasan Computational Complexity Conference (CCC), 2019 | 16 | 2019 |

Unconditional lower bounds in complexity theory IC Oliveira Columbia University (PhD Thesis), 2015 | 16 | 2015 |

Optimal coding theorems in time-bounded Kolmogorov complexity Z Lu, IC Oliveira, M Zimand International Colloquium on Automata, Languages and Programming (ICALP), 2022 | 15 | 2022 |

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 | 15 | 2020 |