Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $ ell_p$-Distances. - Grigory Yaroslavtsev; Adithya Vadapalli (CoRR, 2017)

Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under 𝓁p Distances. - Grigory Yaroslavtsev; Adithya Vadapalli (ICML, 2018)

You May Also Like... Privacy: Recommendation Systems Meet PIR. - Adithya Vadapalli; Fattaneh Bayatbabolghani; Ryan Henry (Proc. Priv. Enhancing Technol., 2021)

Sabre: Sender-Anonymous Messaging with Fast Audits. - Adithya Vadapalli; Kyle Storrier; Ryan Henry (SP, 2022)

Duoram: A Bandwidth-Efficient Distributed ORAM for 2- and 3-Party Computation. - Adithya Vadapalli; Ryan Henry; Ian Goldberg (IACR Cryptol. ePrint Arch., 2022)

Grotto: Screaming fast (2+1)-PC or ℤ2n via (2, 2)-DPFs. - Kyle Storrier; Adithya Vadapalli; Allan Lyons; Ryan Henry (CCS, 2023)

Grotto: Screaming fast (2 + 1)-PC for ℤ2n via (2, 2)-DPFs. - Kyle Storrier; Adithya Vadapalli; Allan Lyons; Ryan Henry (IACR Cryptol. ePrint Arch., 2023)

PRAC: Round-Efficient 3-Party MPC for Dynamic Data Structures. - Sajin Sasy; Adithya Vadapalli; Ian Goldberg (Proc. Priv. Enhancing Technol., 2024)