8 citations · 8 across the 2 of their papers we have counts for
6 papers
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…
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…
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…
The Power of Distributed Verifiers in Interactive Proofs
Moni Naor, Merav Parter, Eylon Yogev
We explore the power of interactive proofs with a distributed verifier. In this setting, the verifier consists of nodes and a graph that defines their communication pattern…
Low Congestion Cycle Covers and their Applications
Merav Parter, Eylon Yogev
A cycle cover of a bridgeless graph is a collection of simple cycles in such that each edge appears on at least one cycle. The common objective in cycle cover computati…
Congested Clique Algorithms for Graph Spanners
Merav Parter, Eylon Yogev
Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide rang…