Rahul Ilango

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 33

Top Topics

Differential Privacy

Top Venues

Electron. Colloquium Comput. Complex.

Computational Complexity Conference

Publications

Shuichi Hirahara, Rahul Ilango, R. Ryan Williams
Beating Brute Force for Compression Problems. STOC (2024)
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira
A Duality between One-Way Functions and Average-Case Symmetry of Information. STOC (2023)
Badih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar, Pasin Manurangsi
Separating Computational and Statistical Differential Privacy (Under Plausible Assumptions). CoRR (2023)
Rahul Ilango, Jiatu Li, R. Ryan Williams
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. STOC (2023)
Rahul Ilango
SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle. FOCS (2023)
Badih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar, Pasin Manurangsi
Towards Separating Computational and Statistical Differential Privacy. FOCS (2023)
Yizhi Huang, Rahul Ilango, Hanlin Ren
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. IACR Cryptol. ePrint Arch. 2023 (2023)
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira
A Duality Between One-Way Functions and Average-Case Symmetry of Information. IACR Cryptol. ePrint Arch. 2023 (2023)
Rahul Ilango, Jiatu Li, Ryan Williams
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. Electron. Colloquium Comput. Complex. (2023)
Shuichi Hirahara, Rahul Ilango, Ryan Williams
Beating Brute Force for Compression Problems. Electron. Colloquium Comput. Complex. (2023)
Rahul Ilango
SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle. Electron. Colloquium Comput. Complex. (2023)
Yizhi Huang, Rahul Ilango, Hanlin Ren
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. STOC (2023)
Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira
A Duality Between One-Way Functions and Average-Case Symmetry of Information. Electron. Colloquium Comput. Complex. (2023)
Yizhi Huang, Rahul Ilango, Hanlin Ren
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. Electron. Colloquium Comput. Complex. (2023)
Rahul Ilango, Hanlin Ren, Rahul Santhanam
Robustness of average-case meta-complexity via pseudorandomness. STOC (2022)
Rahul Ilango
The Minimum Formula Size Problem is (ETH) Hard. FOCS (2022)
Rahul Ilango, Hanlin Ren, Rahul Santhanam
Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Eric Allender, Rahul Ilango, Neekon Vafa
The Non-hardness of Approximating Circuit Size. Theory Comput. Syst. 65 (3) (2021)
Shuichi Hirahara, Rahul Ilango, Bruno Loff
Hardness of Constant-Round Communication Complexity. Computational Complexity Conference (2021)
Rahul Ilango
The Minimum Formula Size Problem is (ETH) Hard. FOCS (2021)
Shuichi Hirahara, Rahul Ilango, Bruno Loff
Hardness of Constant-round Communication Complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Rahul Ilango
Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas. Computational Complexity Conference (2020)
Rahul Ilango
Constant Depth Formula and Partial Function Versions of MCSP are Hard. FOCS (2020)
Rahul Ilango
Constant Depth Formula and Partial Function Versions of MCSP are Hard. Electron. Colloquium Comput. Complex. 27 (2020)
Rahul Ilango
Approaching MCSP from Above and Below: Hardness for a Conditional Variant and AC^0[p]. ITCS (2020)
Rahul Ilango, Bruno Loff, Igor Carboni Oliveira
NP-Hardness of Circuit Minimization for Multi-Output Functions. Computational Complexity Conference (2020)
Rahul Ilango, Bruno Loff, Igor Carboni Oliveira
NP-Hardness of Circuit Minimization for Multi-Output Functions. Electron. Colloquium Comput. Complex. 27 (2020)
Rahul Ilango
$AC^0[p]$ Lower Bounds and NP-Hardness for Variants of MCSP. Electron. Colloquium Comput. Complex. 26 (2019)
Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal
[p] Lower Bounds Against MCSP via the Coin Problem. ICALP (2019)
Eric Allender, Rahul Ilango, Neekon Vafa
The Non-hardness of Approximating Circuit Size. CSR (2019)
Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal
AC0[p] Lower Bounds against MCSP via the Coin Problem. Electron. Colloquium Comput. Complex. 26 (2019)
Eric Allender, Rahul Ilango, Neekon Vafa
The Non-Hardness of Approximating Circuit Size. Electron. Colloquium Comput. Complex. 25 (2018)
Rahul Ilango, Oliver Pechenik, Michael Zlatin
Unique Rectification in d-Complete Posets: Towards the K-Theory of Kac-Moody Flag Varieties. Electron. J. Comb. 25 (4) (2018)