Omri Ben-Eliezer |
office: MIT 2-232B | email: omrib@mit.edu
I am an Instructor (postdoc) in Applied Mathematics at MIT Mathematics. I've completed my PhD in Computer Science at Tel Aviv University, where I was fortunate to be advised by Noga Alon. After that, I spent a couple of months at Weizmann Institute, hosted by Moni Naor, and a year at Harvard University, mentored by Madhu Sudan. Research Interests:
Algorithms for large-scale structured data. I'm especially interested in sublinear-time and streaming algorithms,
adversarially robust algorithms, and learning-based algorithms. I'm also interested in mathematical and algorithmic foundations of more applied areas such as
decision making, data mining, and knowledge representation.
Program Committees: ITCS'22.Check out our recent STOC'21 workshop Robust Streaming, Sketching, and Sampling. |

Omri Ben-Eliezer*, Talya Eden, Joel Oren, Dimitris Fotakis.

Adversarially robust streaming via dense-sparse trade-offs.

Omri Ben-Eliezer, Talya Eden, Krzysztof Onak.

Adversarial laws of large numbers and optimal regret in online classification.

Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev.

Learning multimodal affinities for textual editing in images.

Or Perel*, Oron Anschel, Omri Ben-Eliezer, Shai Mazor, Hadar Averbuch-Elor.

Presented at

What is learned in knowledge graph embeddings?.

Michael R. Douglas*, Michael Simkin, Omri Ben-Eliezer, Tianqi Wu, Peter Chin, Trung V. Dang, Andrew Wood.

Bounded space differentially private quantiles.

Daniel Alabi, Omri Ben-Eliezer, Anamay Chaturvedi.

Limits of ordered graphs and their applications.

Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida.

Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev.

READ: Recursive autoencoders for document layout generation.

Akshay Gadi Patil*, Omri Ben-Eliezer, Or Perel, Hadar Averbuch-Elor.

The adversarial robustness of sampling.

Omri Ben-Eliezer, Eylon Yogev.

Very fast construction of bounded-degree spanning graphs via the semi-random graph process.

Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich.

Semi-random graph process.

Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman, Miloš Stojaković.

Hard properties with (very) short PCPPs and their applications.

Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum.

Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo.

Finding monotone patterns in sublinear time.

Omri Ben-Eliezer, Clément Canonne, Shoham Letzter, Erik Waingraten.

Testing local properties of arrays.

Omri Ben-Eliezer.

On the separation conjecture in Avoider-Enforcer games.

Małgorzata Bednarska-Bzdęga, Omri Ben-Eliezer, Lior Gishboliner, Tuan Tran.

Omri Ben-Eliezer, Eldar Fischer.

Improved bounds for testing forbidden order patterns.

Omri Ben-Eliezer, Clément Canonne.

Testing hereditary properties of ordered graphs and matrices.

Noga Alon, Omri Ben-Eliezer, Eldar Fischer.

Efficient removal lemmas for matrices.

Noga Alon, Omri Ben-Eliezer.

Deleting and testing forbidden patterns in multi-dimensional arrays.

Omri Ben-Eliezer, Simon Korman, Daniel Reichman.

Local and global colorability of graphs.

Noga Alon, Omri Ben-Eliezer.

Omri Ben-Eliezer, Elchanan Mossel, Madhu Sudan.

Optimal adaptive detection of monotone patterns.

Omri Ben-Eliezer, Shoham Letzter, Erik Waingraten.

Local and global colorability of graphs.

**MIT 18.01 Single variable calculus**Fall 2021.**Harvard CMSA computer science for mathematicians seminar**2020/21.**Probabilistic methods in combinatorics**(0366-4913), Tel Aviv University, spring 2017.**Data structures**(0368-2158), Tel Aviv University, 2016/2017.**Programming in python for engineers**(0509-1820), Tel Aviv University, 2015/2016

Accessibility