335 citations · 1k across the 30 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020
Adversarially Robust Streaming Algorithms via Differential Privacy
Avinatan Hassidim, Haim Kaplan, Yishay Mansour +2
A streaming algorithm is said to be adversarially robust if its accuracy guarantees are maintained even when the data stream is chosen maliciously, by an adaptive adversary. We est…
cs.DS2003
Efficient pebbling for list traversal synopses
Yossi Matias, Ely Porat
We show how to support efficient back traversal in a unidirectional list, using small memory and with essentially no slowdown in forward steps. Using memory for a list…
cs.DS2002
Approximate Data Structures with Applications
Yossi Matias, Jeff Vitter, Neal Young
This paper explores the notion of approximate data structures, which return approximately correct answers to queries, but run faster than their exact counterparts. The paper descri…