Rahul Ilango

ScholarGPS® ID: 26913386601954

Affiliation

Massachusetts Institute of Technology, Cambridge, Massachusetts, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Metrics Summary

Publication Count

Predicted Citations

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Beating Brute Force for Compression Problems (conference) Hirahara, Shuichi \| Ilango, Rahul \| Williams, R. Ryan STOC '24: 56th Annual ACM Symposium on Theory of Computing (2024) Vancouver BC Canada 10.1145/3618260.3649778 Cite \| Source
Towards Separating Computational and Statistical Differential Privacy (conference) Ghazi, Badih \| Ilango, Rahul \| Kamath, Pritish \| Kumar, Ravi \| Manurangsi, Pasin 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (2023) Santa Cruz, CA, USA 10.1109/FOCS57990.2023.00042 Cite \| Source
SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle (conference) Ilango, Rahul 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (2023) Santa Cruz, CA, USA 10.1109/FOCS57990.2023.00048 Cited by (2) \| Cite \| Source
A Duality between One-Way Functions and Average-Case Symmetry of Information (conference) Hirahara, Shuichi \| Ilango, Rahul \| Lu, Zhenjian \| Nanashima, Mikito \| Oliveira, Igor C. STOC '23: 55th Annual ACM Symposium on Theory of Computing (2023) Orlando FL USA 10.1145/3564246.3585138 Cited by (1) \| Cite \| Source
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach (conference) Huang, Yizhi \| Ilango, Rahul \| Ren, Hanlin STOC '23: 55th Annual ACM Symposium on Theory of Computing (2023) Orlando FL USA 10.1145/3564246.3585154 Cited by (2) \| Cite \| Source
The Minimum Formula Size Problem is (ETH) Hard (conference) Ilango, Rahul 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (2022) Denver, CO, USA 10.1109/FOCS52979.2021.00050 Cited by (2) \| Cite \| Source
The Non-hardness of Approximating Circuit Size (journal article) Allender, Eric \| Ilango, Rahul \| Vafa, Neekon Theory of Computing Systems, volume 65, issue 3, pages 559-578 (2021). 10.1007/s00224-020-10004-x Cited by (2) \| Cite \| Source
Constant Depth Formula and Partial Function Versions of MCSP are Hard (conference) Ilango, Rahul 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA 10.1109/FOCS46700.2020.00047 Cited by (8) \| Cite \| Source
The Non-hardness of Approximating Circuit Size (book chapter) In Computer Science – Theory and Applications Allender, Eric \| Ilango, Rahul \| Vafa, Neekon Springer International Publishing (2019) 10.1007/978-3-030-19955-5_2 Cited by (4) \| Cite \| Source
Unique Rectification in $d$-Complete Posets: Towards the $K$-Theory of Kac-Moody Flag Varieties (journal article) Ilango, Rahul \| Pechenik, Oliver \| Zlatin, Michael The Electronic Journal of Combinatorics, volume 25, issue 4 (2018). 10.37236/7903 Cited by (1) \| Cite \| Source