Removal Lemmas for Matrices. - Noga Alon; Omri Ben-Eliezer (CoRR, 2016)

Local and global colorability of graphs. - Noga Alon; Omri Ben-Eliezer (Discret. Math., 2016)

Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays. - Omri Ben-Eliezer; Simon Korman; Daniel Reichman 001 (ICALP, 2017)

Testing hereditary properties of ordered graphs and matrices. - Noga Alon; Omri Ben-Eliezer; Eldar Fischer (Electron. Colloquium Comput. Complex., 2017)

Improved Bounds for Testing Forbidden Order Patterns. - Omri Ben-Eliezer; Clément L. Canonne (SODA, 2018)

Limits of Ordered Graphs and Images. - Omri Ben-Eliezer; Eldar Fischer; Amit Levi; Yuichi Yoshida (CoRR, 2018)

Testing local properties of arrays. - Omri Ben-Eliezer (Electron. Colloquium Comput. Complex., 2018)

Earthmover Resilience and Testing in Ordered Structures. - Omri Ben-Eliezer; Eldar Fischer (Electron. Colloquium Comput. Complex., 2018)

Optimal Adaptive Detection of Monotone Patterns. - Omri Ben-Eliezer; Shoham Letzter; Erik Waingarten (CoRR, 2019)

Finding monotone patterns in sublinear time. - Omri Ben-Eliezer; Clément L. Canonne; Shoham Letzter; Erik Waingarten (Electron. Colloquium Comput. Complex., 2019)

The Adversarial Robustness of Sampling. - Omri Ben-Eliezer; Eylon Yogev (IACR Cryptol. ePrint Arch., 2019)

On the separation conjecture in Avoider-Enforcer games. - Malgorzata Bednarska-Bzdega; Omri Ben-Eliezer; Lior Gishboliner; Tuan Tran (J. Comb. Theory B, 2019)

READ: Recursive Autoencoders for Document Layout Generation. - Akshay Gadi Patil; Omri Ben-Eliezer; Or Perel; Hadar Averbuch-Elor (CVPR Workshops, 2020)

Hard Properties with (Very) Short PCPPs and Their Applications. - Omri Ben-Eliezer; Eldar Fischer; Amit Levi; Ron D. Rothblum (ITCS, 2020)

The hat guessing number of graphs. - Noga Alon; Omri Ben-Eliezer; Chong Shangguan; Itzhak Tamo (J. Comb. Theory B, 2020)

Efficient Removal Lemmas for Matrices. - Noga Alon; Omri Ben-Eliezer (Order, 2020)

Very fast construction of bounded-degree spanning graphs via the semi-random graph process. - Omri Ben-Eliezer; Lior Gishboliner; Dan Hefetz; Michael Krivelevich (Random Struct. Algorithms, 2020)

Semi-random graph process. - Omri Ben-Eliezer; Dan Hefetz; Gal Kronenberg; Olaf Parczyk; Clara Shikhelman; Milos Stojakovic (Random Struct. Algorithms, 2020)

Fast Algorithmsin Highly Structured Settings - Omri Ben-Eliezer (2020)

What Is Learned in Knowledge Graph Embeddings? - Michael R. Douglas; Michael Simkin; Omri Ben-Eliezer; Tianqi Wu; Peter Chin 001; Trung V. Dang; Andrew Wood (COMPLEX NETWORKS, 2021)

Ordered Graph Limits and Their Applications. - Omri Ben-Eliezer; Eldar Fischer; Amit Levi; Yuichi Yoshida (ITCS, 2021)

Adversarial laws of large numbers and optimal regret in online classification. - Noga Alon; Omri Ben-Eliezer; Yuval Dagan; Shay Moran; Moni Naor; Eylon Yogev (STOC, 2021)

Information Spread with Error Correction. - Omri Ben-Eliezer; Elchanan Mossel; Madhu Sudan 001 (CoRR, 2021)

A Framework for Adversarially Robust Streaming Algorithms. - Omri Ben-Eliezer; Rajesh Jayaram; David P. Woodruff; Eylon Yogev (SIGMOD Rec., 2021)

Learning Multimodal Affinities for Textual Editing in Images. - Or Perel; Oron Anschel; Omri Ben-Eliezer; Shai Mazor; Hadar Averbuch-Elor (ACM Trans. Graph., 2021)

Finding Monotone Patterns in Sublinear Time, Adaptively. - Omri Ben-Eliezer; Shoham Letzter; Erik Waingarten (ICALP, 2022)

Active Learning Polynomial Threshold Functions. - Omri Ben-Eliezer; Max Hopkins; Chutong Yang; Hantao Yu (NeurIPS, 2022)

Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions. - Omri Ben-Eliezer; Dan Mikulincer; Ilias Zadik (NeurIPS, 2022)

Adversarially Robust Streaming via Dense-Sparse Trade-offs. - Omri Ben-Eliezer; Talya Eden; Krzysztof Onak (SOSA, 2022)

Sampling Multiple Nodes in Large Networks: Beyond Random Walks. - Omri Ben-Eliezer; Talya Eden; Joel Oren; Dimitris Fotakis 001 (WSDM, 2022)

Is This Correct? Let's Check! - Omri Ben-Eliezer; Dan Mikulincer; Elchanan Mossel; Madhu Sudan 001 (ITCS, 2023)

Does Prior Knowledge Help Detect Collisions? - Omri Ben-Eliezer; Tomer Grossman; Moni Naor (Electron. Colloquium Comput. Complex., 2023)

Bounded Space Differentially Private Quantiles. - Daniel Alabi; Omri Ben-Eliezer; Anamay Chaturvedi (Trans. Mach. Learn. Res., 2023)

Property Testing with Online Adversaries. - Omri Ben-Eliezer; Esty Kelman; Uri Meir; Sofya Raskhodnikova (ITCS, 2024)

Approximate counting of permutation patterns. - Omri Ben-Eliezer; Slobodan Mitrovic; Pranjal Srivastava (CoRR, 2024)

On the Instance Optimality of Detecting Collisions and Subgraphs. - Omri Ben-Eliezer; Tomer Grossman; Moni Naor (ICALP, 2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. - Sabyasachi Basu; Nadia Koshima; Talya Eden; Omri Ben-Eliezer; C. Seshadhri 001 (WSDM, 2025)