Follow
Omri Ben-Eliezer
Title
Cited by
Cited by
Year
A framework for adversarially robust streaming algorithms
O Ben-Eliezer, R Jayaram, DP Woodruff, E Yogev
Journal of the ACM 69 (2), 1-33, 2022
482022
The adversarial robustness of sampling
O Ben-Eliezer, E Yogev
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020
272020
Adversarial laws of large numbers and optimal regret in online classification
N Alon, O Ben-Eliezer, Y Dagan, S Moran, M Naor, E Yogev
53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2021), 447-455, 2021
262021
READ: Recursive autoencoders for document layout generation
AG Patil, O Ben-Eliezer, O Perel, H Averbuch-Elor
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 2020
252020
The hat guessing number of graphs
N Alon, O Ben-Eliezer, C Shangguan, I Tamo
Journal of Combinatorial Theory, Series B 144, 119-149, 2020
202020
Improved bounds for testing forbidden order patterns
O Ben-Eliezer, CL Canonne
Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018 …, 2018
172018
Testing hereditary properties of ordered graphs and matrices
N Alon, O Ben-Eliezer, E Fischer
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
162017
Finding monotone patterns in sublinear time
O Ben-Eliezer, C Canonne, S Letzter, E Waingarten
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
152019
Deleting and testing forbidden patterns in multi-dimensional arrays
O Ben-Eliezer, S Korman, D Reichman
44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017
142017
Testing local properties of arrays
O Ben-Eliezer
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019
122019
Semi‐random graph process
O Ben‐Eliezer, D Hefetz, G Kronenberg, O Parczyk, C Shikhelman, ...
Random Structures & Algorithms 56 (3), 648-675, 2020
112020
Adversarially Robust Streaming via Dense-Sparse Trade-offs
O Ben-Eliezer, T Eden, K Onak
Symposium on Simplicity in Algorithms (SOSA 2022), 214-227, 2022
92022
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
O Ben-Eliezer, L Gishboliner, D Hefetz, M Krivelevich
Thirty First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020 …, 2020
92020
Hard properties with (very) short PCPPs and their applications
O Ben-Eliezer, E Fischer, A Levi, RD Rothblum
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
82020
Ordered Graph Limits and Their Applications
O Ben-Eliezer, E Fischer, A Levi, Y Yoshida
12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021
7*2021
Efficient removal lemmas for matrices
N Alon, O Ben-Eliezer
Order 37, 83-101, 2020
7*2020
Earthmover resilience and testing in ordered structures
O Ben-Eliezer, E Fischer
Computational Complexity Conference 2018, 18:1-18:35, 2018
72018
Bounded Space Differentially Private Quantiles
D Alabi, O Ben-Eliezer, A Chaturvedi
arXiv preprint arXiv:2201.03380, 2022
32022
Finding Monotone Patterns in Sublinear Time, Adaptively
S Letzter, O Ben-Eliezer, E Waingarten
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
2*2022
On the separation conjecture in Avoider–Enforcer games
M Bednarska-Bzdȩga, O Ben-Eliezer, L Gishboliner, T Tran
Journal of Combinatorial Theory, Series B 138, 41-77, 2019
22019
The system can't perform the operation now. Try again later.
Articles 1–20