Unique Rectification in d-Complete Posets: Towards the K-Theory of Kac-Moody Flag Varieties. - Rahul Ilango; Oliver Pechenik; Michael Zlatin (Electron. J. Comb., 2018)

The Non-Hardness of Approximating Circuit Size. - Eric Allender; Rahul Ilango; Neekon Vafa (Electron. Colloquium Comput. Complex., 2018)

AC0[p] Lower Bounds Against MCSP via the Coin Problem. - Alexander Golovnev; Rahul Ilango; Russell Impagliazzo; Valentine Kabanets; Antonina Kolokolova; Avishay Tal (ICALP, 2019)

AC0[p] Lower Bounds against MCSP via the Coin Problem. - Alexander Golovnev; Rahul Ilango; Russell Impagliazzo; Valentine Kabanets; Antonina Kolokolova; Avishay Tal (Electron. Colloquium Comput. Complex., 2019)

$AC^0[p]$ Lower Bounds and NP-Hardness for Variants of MCSP. - Rahul Ilango (Electron. Colloquium Comput. Complex., 2019)

Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas. - Rahul Ilango (CCC, 2020)

Approaching MCSP from Above and Below: Hardness for a Conditional Variant and AC^0[p]. - Rahul Ilango (ITCS, 2020)

NP-Hardness of Circuit Minimization for Multi-Output Functions. - Rahul Ilango; Bruno Loff; Igor Carboni Oliveira (Electron. Colloquium Comput. Complex., 2020)

The Minimum Formula Size Problem is (ETH) Hard. - Rahul Ilango (FOCS, 2021)

Hardness of Constant-round Communication Complexity. - Shuichi Hirahara; Rahul Ilango; Bruno Loff (Electron. Colloquium Comput. Complex., 2021)

Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity. - Rahul Ilango; Hanlin Ren; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2021)

Robustness of average-case meta-complexity via pseudorandomness. - Rahul Ilango; Hanlin Ren; Rahul Santhanam (STOC, 2022)

Towards Separating Computational and Statistical Differential Privacy. - Badih Ghazi; Rahul Ilango; Pritish Kamath; Ravi Kumar 001; Pasin Manurangsi (FOCS, 2023)

Separating Computational and Statistical Differential Privacy (Under Plausible Assumptions). - Badih Ghazi; Rahul Ilango; Pritish Kamath; Ravi Kumar 001; Pasin Manurangsi (CoRR, 2023)

Beating Brute Force for Compression Problems. - Shuichi Hirahara; Rahul Ilango; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2023)

A Duality Between One-Way Functions and Average-Case Symmetry of Information. - Shuichi Hirahara; Rahul Ilango; Zhenjian Lu; Mikito Nanashima; Igor Carboni Oliveira (Electron. Colloquium Comput. Complex., 2023)

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. - Yizhi Huang; Rahul Ilango; Hanlin Ren (Electron. Colloquium Comput. Complex., 2023)

SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle. - Rahul Ilango (Electron. Colloquium Comput. Complex., 2023)

Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. - Rahul Ilango; Jiatu Li; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2023)

Constant Depth Formula and Partial Function Versions of MCSP Are Hard. - Rahul Ilango (SIAM J. Comput., 2024)

Communication Complexity is NP-hard. - Shuichi Hirahara; Rahul Ilango; Bruno Loff (Electron. Colloquium Comput. Complex., 2025)

Godel in Cryptography: Effectively Zero-Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness. - Rahul Ilango (Electron. Colloquium Comput. Complex., 2025)

Cryptography meets worst-case complexity: Optimal security and more from iO and worst-case assumptions. - Rahul Ilango; Alex Lombardi (Electron. Colloquium Comput. Complex., 2025)