4 citations · 10 across the 10 of their papers we have counts for
6 papers · 1 filter
Optimal Adaptive Detection of Monotone Patterns
Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten
We investigate adaptive sublinear algorithms for detecting monotone patterns in an array. Given fixed and , consider the problem of findi…
Finding monotone patterns in sublinear time
Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter +1
We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed and , we show that the n…
Hard properties with (very) short PCPPs and their applications
Omri Ben-Eliezer, Eldar Fischer, Amit Levi +1
We show that there exist properties that are maximally hard for testing, while still admitting PCPPs with a proof size very close to linear. Specifically, for every fixed , w…
READ: Recursive Autoencoders for Document Layout Generation
Akshay Gadi Patil, Omri Ben-Eliezer, Or Perel +1
Layout is a fundamental component of any graphic design. Creating large varieties of plausible document layouts can be a tedious task, requiring numerous constraints to be satisfie…
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz +1
Semi-random processes involve an adaptive decision-maker, whose goal is to achieve some predetermined objective in an online randomized environment. They have algorithmic implicati…
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…