default search action
Omri Ben-Eliezer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Omri Ben-Eliezer, Esty Kelman, Uri Meir, Sofya Raskhodnikova:
Property Testing with Online Adversaries. ITCS 2024: 11:1-11:25 - [i33]Sabyasachi Basu
, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri:
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. CoRR abs/2406.08624 (2024) - 2023
- [j10]Daniel Alabi, Omri Ben-Eliezer, Anamay Chaturvedi:
Bounded Space Differentially Private Quantiles. Trans. Mach. Learn. Res. 2023 (2023) - [c22]Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, Madhu Sudan:
Is This Correct? Let's Check! ITCS 2023: 15:1-15:11 - [i32]Omri Ben-Eliezer, Esty Kelman, Uri Meir, Sofya Raskhodnikova:
Property Testing with Online Adversaries. CoRR abs/2311.16566 (2023) - [i31]Omri Ben-Eliezer, Tomer Grossman, Moni Naor:
Does Prior Knowledge Help Detect Collisions? CoRR abs/2312.10196 (2023) - [i30]Omri Ben-Eliezer, Tomer Grossman, Moni Naor:
Does Prior Knowledge Help Detect Collisions? Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j9]Omri Ben-Eliezer
A Framework for Adversarially Robust Streaming Algorithms. J. ACM 69(2): 17:1-17:33 (2022) - [c21]Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten:
Finding Monotone Patterns in Sublinear Time, Adaptively. ICALP 2022: 17:1-17:19 - [c20]Omri Ben-Eliezer, Max Hopkins, Chutong Yang, Hantao Yu:
Active Learning Polynomial Threshold Functions. NeurIPS 2022 - [c19]Omri Ben-Eliezer, Dan Mikulincer, Ilias Zadik:
Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions. NeurIPS 2022 - [c18]Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. SOSA 2022: 214-227 - [c17]Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. WSDM 2022: 37-47 - [i29]Daniel Alabi, Omri Ben-Eliezer, Anamay Chaturvedi:
Bounded Space Differentially Private Quantiles. CoRR abs/2201.03380 (2022) - [i28]Omri Ben-Eliezer, Max Hopkins, Chutong Yang, Hantao Yu:
Active Learning Polynomial Threshold Functions. CoRR abs/2201.09433 (2022) - [i27]Omri Ben-Eliezer, Dan Mikulincer, Ilias Zadik:
Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions. CoRR abs/2208.07438 (2022) - [i26]Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, Madhu Sudan:
Is this correct? Let's check! CoRR abs/2211.12301 (2022) - 2021
- [j8]Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
A Framework for Adversarially Robust Streaming Algorithms. SIGMOD Rec. 50(1): 6-13 (2021) - [j7]Or Perel
Learning Multimodal Affinities for Textual Editing in Images. ACM Trans. Graph. 40(3): 26:1-26:16 (2021) - [c16]Michael R. Douglas, Michael Simkin, Omri Ben-Eliezer, Tianqi Wu, Peter Chin, Trung V. Dang, Andrew Wood:
What Is Learned in Knowledge Graph Embeddings? COMPLEX NETWORKS 2021: 587-602 - [c15]Omri Ben-Eliezer, Eldar Fischer, Amit Levi
Ordered Graph Limits and Their Applications. ITCS 2021: 42:1-42:20 - [c14]Noga Alon
Adversarial laws of large numbers and optimal regret in online classification. STOC 2021: 447-455 - [i25]Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev:
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. CoRR abs/2101.09054 (2021) - [i24]Or Perel
Learning Multimodal Affinities for Textual Editing in Images. CoRR abs/2103.10139 (2021) - [i23]Omri Ben-Eliezer, Elchanan Mossel, Madhu Sudan:
Information Spread with Error Correction. CoRR abs/2107.06362 (2021) - [i22]Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. CoRR abs/2109.03785 (2021) - [i21]Michael R. Douglas, Michael Simkin, Omri Ben-Eliezer, Tianqi Wu, Peter Chin, Trung V. Dang, Andrew Wood:
What is Learned in Knowledge Graph Embeddings? CoRR abs/2110.09978 (2021) - [i20]Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. CoRR abs/2110.13324 (2021) - 2020
- [b1]Omri Ben-Eliezer:
Fast Algorithmsin Highly Structured Settings. Tel Aviv University, Israel, 2020 - [j6]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The hat guessing number of graphs. J. Comb. Theory B 144: 119-149 (2020) - [j5]Noga Alon, Omri Ben-Eliezer
Efficient Removal Lemmas for Matrices. Order 37(1): 83-101 (2020) - [j4]Omri Ben-Eliezer, Dan Hefetz
Semi-random graph process. Random Struct. Algorithms 56(3): 648-675 (2020) - [j3]Omri Ben-Eliezer, Lior Gishboliner
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Random Struct. Algorithms 57(4): 892-919 (2020) - [c13]Akshay Gadi Patil, Omri Ben-Eliezer, Or Perel, Hadar Averbuch-Elor:
READ: Recursive Autoencoders for Document Layout Generation. CVPR Workshops 2020: 2316-2325 - [c12]Omri Ben-Eliezer, Eldar Fischer, Amit Levi
Hard Properties with (Very) Short PCPPs and Their Applications. ITCS 2020: 9:1-9:27 - [c11]Omri Ben-Eliezer, Eylon Yogev:
The Adversarial Robustness of Sampling. PODS 2020: 49-62 - [c10]Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
A Framework for Adversarially Robust Streaming Algorithms. PODS 2020: 63-80 - [c9]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich:
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. SODA 2020: 718-737 - [i19]Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
A Framework for Adversarially Robust Streaming Algorithms. CoRR abs/2003.14265 (2020)
2010 – 2019
- 2019
- [j2]Malgorzata Bednarska-Bzdega, Omri Ben-Eliezer, Lior Gishboliner
On the separation conjecture in Avoider-Enforcer games. J. Comb. Theory B 138: 41-77 (2019) - [c8]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter
Finding Monotone Patterns in Sublinear Time. FOCS 2019: 1469-1494 - [c7]Omri Ben-Eliezer:
Testing Local Properties of Arrays. ITCS 2019: 11:1-11:20 - [c6]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The Hat Guessing Number of Graphs. ISIT 2019: 490-494 - [i18]Omri Ben-Eliezer, Eylon Yogev:
The Adversarial Robustness of Sampling. CoRR abs/1906.11327 (2019) - [i17]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. CoRR abs/1907.08031 (2019) - [i16]Akshay Gadi Patil, Omri Ben-Eliezer, Or Perel
READ: Recursive Autoencoders for Document Layout Generation. CoRR abs/1909.00302 (2019) - [i15]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum:
Hard properties with (very) short PCPPs and their applications. CoRR abs/1909.03255 (2019) - [i14]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding monotone patterns in sublinear time. CoRR abs/1910.01749 (2019) - [i13]Omri Ben-Eliezer, Shoham Letzter
Optimal Adaptive Detection of Monotone Patterns. CoRR abs/1911.01169 (2019) - [i12]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding monotone patterns in sublinear time. Electron. Colloquium Comput. Complex. TR19 (2019) - [i11]Omri Ben-Eliezer, Eylon Yogev:
The Adversarial Robustness of Sampling. IACR Cryptol. ePrint Arch. 2019: 764 (2019) - 2018
- [c5]Omri Ben-Eliezer, Eldar Fischer:
Earthmover Resilience and Testing in Ordered Structures. CCC 2018: 18:1-18:35 - [c4]Omri Ben-Eliezer, Clément L. Canonne:
Improved Bounds for Testing Forbidden Order Patterns. SODA 2018: 2093-2112 - [i10]Omri Ben-Eliezer, Eldar Fischer:
Earthmover Resilience and Testing in Ordered Structures. CoRR abs/1801.09798 (2018) - [i9]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida:
Limits of Ordered Graphs and Images. CoRR abs/1811.02023 (2018) - [i8]Omri Ben-Eliezer:
Testing local properties of arrays. CoRR abs/1811.07448 (2018) - [i7]Noga Alon, Omri Ben-Eliezer, Chong Shangguan
The hat guessing number of graphs. CoRR abs/1812.09752 (2018) - [i6]Omri Ben-Eliezer:
Testing local properties of arrays. Electron. Colloquium Comput. Complex. TR18 (2018) - [i5]Omri Ben-Eliezer, Eldar Fischer:
Earthmover Resilience and Testing in Ordered Structures. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c3]Noga Alon, Omri Ben-Eliezer:
Efficient Removal Lemmas for Matrices. APPROX-RANDOM 2017: 25:1-25:18 - [c2]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing Hereditary Properties of Ordered Graphs and Matrices. FOCS 2017: 848-858 - [c1]Omri Ben-Eliezer, Simon Korman, Daniel Reichman:
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays. ICALP 2017: 9:1-9:14 - [i4]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing hereditary properties of ordered graphs and matrices. CoRR abs/1704.02367 (2017) - [i3]Omri Ben-Eliezer, Clément L. Canonne:
Improved Bounds for Testing Forbidden Order Patterns. CoRR abs/1710.10660 (2017) - [i2]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing hereditary properties of ordered graphs and matrices. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j1]Noga Alon, Omri Ben-Eliezer:
Local and global colorability of graphs. Discret. Math. 339(2): 428-442 (2016) - [i1]Noga Alon, Omri Ben-Eliezer:
Removal Lemmas for Matrices. CoRR abs/1609.04235 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: