2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CC2025
Communication Complexity is NP-hard
Shuichi Hirahara, Rahul Ilango, Bruno Loff
In the paper where he first defined Communication Complexity, Yao asks: \emph{Is computing (the 2-way communication complexity of a given function ) NP-complete?} The pr…
cs.CR2023★ 1 cited
Towards Separating Computational and Statistical Differential Privacy
Badih Ghazi, Rahul Ilango, Pritish Kamath +2
Computational differential privacy (CDP) is a natural relaxation of the standard notion of (statistical) differential privacy (SDP) proposed by Beimel, Nissim, and Omri (CRYPTO 200…
math.CO2018★ 2 cited
Unique rectification in -complete posets: towards the -theory of Kac-Moody flag varieties
Rahul Ilango, Oliver Pechenik, Michael Zlatin
The jeu-de-taquin-based Littlewood-Richardson rule of H. Thomas and A. Yong (2009) for minuscule varieties has been extended in two orthogonal directions, either enriching the coho…