activity
20132026
most citedA Framework for Adversarially Robust Streaming Algorithms

23 citations · 38 across the 9 of their papers we have counts for

collaborators

13 papers

cs.CL2026★ 3 cited

Accelerating Scientific Research with Gemini: Case Studies and Common Techniques

David P. Woodruff, Vincent Cohen-Addad, Lalit Jain +33

Recent advances in large language models (LLMs) have opened new avenues for accelerating scientific research. While models are increasingly capable of assisting with routine tasks,…

cs.CR2021

Distributional Collision Resistance Beyond One-Way Functions

Nir Bitansky, Iftach Haitner, Ilan Komargodski +1

Distributional collision resistance is a relaxation of collision resistance that only requires that it is hard to sample a collision where is uniformly random and i…

cs.LG2021

Adversarial Laws of Large Numbers and Optimal Regret in Online Classification

Noga Alon, Omri Ben-Eliezer, Yuval Dagan +3

Laws of large numbers guarantee that given a large enough sample from some population, the measure of any fixed sub-population is well-estimated by its frequency in the sample. We…

cs.DS2020★ 23 cited

A Framework for Adversarially Robust Streaming Algorithms

Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff +1

We investigate the adversarial robustness of streaming algorithms. In this context, an algorithm is considered robust if its performance guarantees hold even if the stream is chose…

cs.DS2019

The Adversarial Robustness of Sampling

Omri Ben-Eliezer, Eylon Yogev

Random sampling is a fundamental primitive in modern algorithms, statistics, and machine learning, used as a generic method to obtain a small yet "representative" subset of the dat…

cs.DC2019★ 8 cited

Parallel Balanced Allocations: The Heavily Loaded Case

Christoph Lenzen, Merav Parter, Eylon Yogev

We study parallel algorithms for the classical balls-into-bins problem, in which balls acting in parallel as separate agents are placed into bins. Algorithms operate in syn…