default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRahul Ilango
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Shuichi Hirahara
, Rahul Ilango, R. Ryan Williams:
Beating Brute Force for Compression Problems. STOC 2024: 659-670- 2023
- [c14]Badih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar, Pasin Manurangsi:
Towards Separating Computational and Statistical Differential Privacy. FOCS 2023: 580-599 - [c13]Rahul Ilango:
SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle. FOCS 2023: 733-742 - [c12]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira:
A Duality between One-Way Functions and Average-Case Symmetry of Information. STOC 2023: 1039-1050 - [c11]Yizhi Huang, Rahul Ilango, Hanlin Ren:
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. STOC 2023: 1067-1075 - [c10]Rahul Ilango, Jiatu Li, R. Ryan Williams:
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. STOC 2023: 1076-1089 - [i15]Badih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar, Pasin Manurangsi:
Separating Computational and Statistical Differential Privacy (Under Plausible Assumptions). CoRR abs/2301.00104 (2023) - [i14]Shuichi Hirahara, Rahul Ilango, Ryan Williams:
Beating Brute Force for Compression Problems. Electron. Colloquium Comput. Complex. TR23 (2023) - [i13]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. TR23 (2023) - [i12]Yizhi Huang, Rahul Ilango, Hanlin Ren:
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. Electron. Colloquium Comput. Complex. TR23 (2023) - [i11]Rahul Ilango:
SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle. Electron. Colloquium Comput. Complex. TR23 (2023) - [i10]Rahul Ilango, Jiatu Li, Ryan Williams:
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. Electron. Colloquium Comput. Complex. TR23 (2023) - [i9]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira:
A Duality Between One-Way Functions and Average-Case Symmetry of Information. IACR Cryptol. ePrint Arch. 2023: 424 (2023) - [i8]Yizhi Huang, Rahul Ilango, Hanlin Ren:
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. IACR Cryptol. ePrint Arch. 2023: 528 (2023) - 2022
- [c9]Rahul Ilango, Hanlin Ren, Rahul Santhanam:
Robustness of average-case meta-complexity via pseudorandomness. STOC 2022: 1575-1583 - 2021
- [j2]Eric Allender, Rahul Ilango, Neekon Vafa:
The Non-hardness of Approximating Circuit Size. Theory Comput. Syst. 65(3): 559-578 (2021) - [c8]Shuichi Hirahara, Rahul Ilango, Bruno Loff:
Hardness of Constant-Round Communication Complexity. CCC 2021: 31:1-31:30 - [c7]Rahul Ilango:
The Minimum Formula Size Problem is (ETH) Hard. FOCS 2021: 427-432 - [i7]Shuichi Hirahara, Rahul Ilango, Bruno Loff:
Hardness of Constant-round Communication Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i6]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. TR21 (2021) - 2020
- [c6]Rahul Ilango, Bruno Loff, Igor C. Oliveira:
NP-Hardness of Circuit Minimization for Multi-Output Functions. CCC 2020: 22:1-22:36 - [c5]Rahul Ilango:
Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas. CCC 2020: 31:1-31:35 - [c4]Rahul Ilango:
Constant Depth Formula and Partial Function Versions of MCSP are Hard. FOCS 2020: 424-433 - [c3]Rahul Ilango:
Approaching MCSP from Above and Below: Hardness for a Conditional Variant and AC^0[p]. ITCS 2020: 34:1-34:26 - [i5]Rahul Ilango:
Constant Depth Formula and Partial Function Versions of MCSP are Hard. Electron. Colloquium Comput. Complex. TR20 (2020) - [i4]Rahul Ilango, Bruno Loff, Igor Carboni Oliveira:
NP-Hardness of Circuit Minimization for Multi-Output Functions. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c2]Eric Allender, Rahul Ilango, Neekon Vafa:
The Non-hardness of Approximating Circuit Size. CSR 2019: 13-24 - [c1]Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal:
AC0[p] Lower Bounds Against MCSP via the Coin Problem. ICALP 2019: 66:1-66:15 - [i3]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. TR19 (2019) - [i2]Rahul Ilango:
$AC^0[p]$ Lower Bounds and NP-Hardness for Variants of MCSP. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j1]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): 4 (2018) - [i1]Eric Allender, Rahul Ilango, Neekon Vafa:
The Non-Hardness of Approximating Circuit Size. Electron. Colloquium Comput. Complex. TR18 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
