2 citations · 2 across the 2 of their papers we have counts for
5 papers
A Simple and Robust Protocol for Distributed Counting
Edith Cohen, Moshe Shechner, Uri Stemmer
We revisit the distributed counting problem, where a server must continuously approximate the total number of events occurring across sites while minimizing communication. The…
Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Model
Menachem Sadigurschi, Moshe Shechner, Uri Stemmer
Streaming algorithms are typically analyzed in the oblivious setting, where we assume that the input stream is fixed in advance. Recently, there is a growing interest in designing…
On the Robustness of CountSketch to Adaptive Inputs
Edith Cohen, Xin Lyu, Jelani Nelson +3
CountSketch is a popular dimensionality reduction technique that maps vectors to a lower dimension using randomized linear measurements. The sketch supports recovering -hea…
A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators
Idan Attias, Edith Cohen, Moshe Shechner +1
Classical streaming algorithms operate under the (not always reasonable) assumption that the input stream is fixed in advance. Recently, there is a growing interest in designing ro…
Differentially Private Algorithms for Clustering with Stability Assumptions
Moshe Shechner
We study the problem of differentially private clustering under input-stability assumptions. Despite the ever-growing volume of works on differential privacy in general and differe…