| 2026 | LICS | Meta-Mathematics of Algebraic Complexity. | Michal Garlk, Svyatoslav Gryaznov, Jiaqi Lu, Rahul Santhanam, Iddo Tzameret |
| 2024 | FOCS | On the Complexity of Avoiding Heavy Elements. | Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2024 | ICALP | From Proof Complexity to Circuit Complexity via Interactive Protocols. | Noel Arteche, Erfan Khaniki, Jn Pich, Rahul Santhanam |
| 2024 | ICALP | Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity. | Zhenjian Lu, Rahul Santhanam |
| 2023 | FOCS | Polynomial-Time Pseudodeterministic Construction of Primes. | Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2022 | FOCS | On the Range Avoidance Problem for Circuits. | Hanlin Ren, Rahul Santhanam, Zhikun Wang |
| 2022 | ICALP | Learning Algorithms Versus Automatability of Frege Systems. | Jn Pich, Rahul Santhanam |
| 2022 | STOC | Robustness of average-case meta-complexity via pseudorandomness. | Rahul Ilango, Hanlin Ren, Rahul Santhanam |
| 2022 | STACS | A Relativization Perspective on Meta-Complexity. | Hanlin Ren, Rahul Santhanam |
| 2021 | FOCS | Constructive Separations and Their Consequences. | Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams |
| 2021 | STOC | Pseudodeterministic algorithms and the structure of probabilistic time. | Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam |
| 2021 | STOC | Strong co-nondeterministic lower bounds for NP cannot be proved feasibly. | Jn Pich, Rahul Santhanam |
| 2021 | STOC | Iterated lower bound formulas: a diagonalization-based approach to proof complexity. | Rahul Santhanam, Iddo Tzameret |
| 2019 | FOCS | Why are Proof Complexity Lower Bounds Hard? | Jn Pich, Rahul Santhanam |
| 2018 | FOCS | Hardness Magnification for Natural Problems. | Igor Carboni Oliveira, Rahul Santhanam |
| 2018 | LATIN | An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0. | Ruiwen Chen, Igor C. Oliveira, Rahul Santhanam |
| 2018 | MFCS | Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. | Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan |
| 2017 | STOC | Pseudodeterministic constructions in subexponential time. | Igor C. Oliveira, Rahul Santhanam |
| 2016 | ESA | Exponential Time Paradigms Through the Polynomial Time Lens. | Andrew Drucker, Jesper Nederlof, Rahul Santhanam |
| 2015 | SODA | Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity. | Rahul Santhanam, Richard Ryan Williams |
| 2015 | SAT | Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. | Ruiwen Chen, Rahul Santhanam |
| 2012 | FOCS | Lower Bounds on Interactive Compressibility by Constant-Depth Circuits. | Arkadev Chattopadhyay, Rahul Santhanam |
| 2012 | ICALP | On the Limits of Sparsification. | Rahul Santhanam, Srikanth Srinivasan |
| 2012 | STACS | Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. | Maurice J. Jansen, Rahul Santhanam |
| 2011 | ICALP | Exponential Lower Bounds for AC | Yuval Filmus, Toniann Pitassi, Rahul Santhanam |
| 2011 | ICALP | Robust Simulations and Significant Separations. | Lance Fortnow, Rahul Santhanam |
| 2011 | ICALP | Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth. | Maurice J. Jansen, Rahul Santhanam |
| 2010 | CiE | The Complexity of Explicit Constructions. | Rahul Santhanam |
| 2010 | FOCS | Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability. | Rahul Santhanam |
| 2009 | ICALP | Unconditional Lower Bounds against Advice. | Harry Buhrman, Lance Fortnow, Rahul Santhanam |
| 2009 | MFCS | Branching Programs for Tree Evaluation. | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
| 2008 | STOC | Infeasibility of instance compression and succinct PCPs for NP. | Lance Fortnow, Rahul Santhanam |
| 2007 | STOC | Circuit lower bounds for Merlin-Arthur classes. | Rahul Santhanam |
| 2006 | ICML | Graph model selection using maximum likelihood. | Ivona Bezkov, Adam Kalai, Rahul Santhanam |
| 2005 | STOC | Hierarchies for semantic classes. | Lance Fortnow, Rahul Santhanam, Luca Trevisan |
| 2004 | FOCS | Hierarchy Theorems for Probabilistic Polynomial Time. | Lance Fortnow, Rahul Santhanam |