175 citations · 262 across the 24 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 1 cited
Data Structures Meet Cryptography: 3SUM with Preprocessing
Alexander Golovnev, Siyao Guo, Thibaut Horel +2
This paper shows several connections between data structure problems and cryptography against preprocessing attacks. Our results span data structure upper bounds, cryptographic app…
cs.DS2013★ 4 cited
Tight Bounds for Set Disjointness in the Message Passing Model
Mark Braverman, Faith Ellen, Rotem Oshman +2
In a multiparty message-passing model of communication, there are players. Each player has a private input, and they communicate by sending messages to one another over private…