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 | 92 | 2022 |
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 | 60 | 2020 |
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 | 51 | 2021 |
The adversarial robustness of sampling O Ben-Eliezer, E Yogev Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020 | 40 | 2020 |
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 | 31 | 2020 |
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 | 25 | 2022 |
Semi‐random graph process O Ben‐Eliezer, D Hefetz, G Kronenberg, O Parczyk, C Shikhelman, ... Random Structures & Algorithms 56 (3), 648-675, 2020 | 22 | 2020 |
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 | 20 | 2017 |
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 | 19 | 2020 |
Bounded space differentially private quantiles D Alabi, O Ben-Eliezer, A Chaturvedi Transactions on Machine Learning Research, 2023 | 18 | 2023 |
Improved bounds for testing forbidden order patterns O Ben-Eliezer, CL Canonne Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018 …, 2018 | 18 | 2018 |
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 | 16 | 2019 |
Testing local properties of arrays O Ben-Eliezer 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019 | 14 | 2019 |
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 | 14 | 2017 |
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 | 12 | 2020 |
Ordered graph limits and their applications O Ben-Eliezer, E Fischer, A Levi, Y Yoshida arXiv preprint arXiv:1811.02023, 2018 | 10* | 2018 |
Efficient removal lemmas for matrices N Alon, O Ben-Eliezer Order 37, 83-101, 2020 | 9* | 2020 |
Earthmover resilience and testing in ordered structures O Ben-Eliezer, E Fischer Computational Complexity Conference 2018, 18:1-18:35, 2018 | 8 | 2018 |
Sampling Multiple Nodes in Large Networks: Beyond Random Walks O Ben-Eliezer, T Eden, J Oren, D Fotakis WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web …, 2022 | 7 | 2022 |
Archimedes meets privacy: On privately estimating quantiles in high dimensions under minimal assumptions O Ben-Eliezer, D Mikulincer, I Zadik Advances in Neural Information Processing Systems 35 (NeurIPS 2022), 2022 | 6 | 2022 |