| 2026 | SODA | Approximate Counting of Permutation Patterns. | Omri Ben-Eliezer, Slobodan Mitrovic, Pranjal Srivastava |
| 2025 | ICALP | On the Instance Optimality of Detecting Collisions and Subgraphs. | Omri Ben-Eliezer, Tomer Grossman, Moni Naor |
| 2025 | WSDM | A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. | Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri |
| 2022 | ICALP | Finding Monotone Patterns in Sublinear Time, Adaptively. | Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten |
| 2022 | WSDM | Sampling Multiple Nodes in Large Networks: Beyond Random Walks. | Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis |
| 2021 | STOC | Adversarial laws of large numbers and optimal regret in online classification. | Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev |
| 2020 | CVPR | READ: Recursive Autoencoders for Document Layout Generation. | Akshay Gadi Patil, Omri Ben-Eliezer, Or Perel, Hadar Averbuch-Elor |
| 2020 | PODS | A Framework for Adversarially Robust Streaming Algorithms. | Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev |
| 2020 | PODS | The Adversarial Robustness of Sampling. | Omri Ben-Eliezer, Eylon Yogev |
| 2020 | SODA | Very fast construction of bounded-degree spanning graphs via the semi-random graph process. | Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich |
| 2019 | FOCS | Finding Monotone Patterns in Sublinear Time. | Omri Ben-Eliezer, Clment L. Canonne, Shoham Letzter, Erik Waingarten |
| 2019 | ISIT | The Hat Guessing Number of Graphs. | Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo |
| 2018 | SODA | Improved Bounds for Testing Forbidden Order Patterns. | Omri Ben-Eliezer, Clment L. Canonne |
| 2017 | FOCS | Testing Hereditary Properties of Ordered Graphs and Matrices. | Noga Alon, Omri Ben-Eliezer, Eldar Fischer |
| 2017 | ICALP | Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays. | Omri Ben-Eliezer, Simon Korman, Daniel Reichman |