| Optimal hashing-based time-space trade-offs for approximate near neighbors A Andoni, T Laarhoven, I Razenshteyn, E Waingarten Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 125 | 2017 |
| Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness X Chen, E Waingarten, J Xie Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 49 | 2017 |
| Approximate near neighbors for general symmetric norms A Andoni, HL Nguyen, A Nikolov, I Razenshteyn, E Waingarten Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 31 | 2017 |
| Settling the query complexity of non-adaptive junta testing X Chen, RA Servedio, LY Tan, E Waingarten, J Xie Journal of the ACM (JACM) 65 (6), 1-18, 2018 | 29 | 2018 |
| Data-dependent hashing via nonlinear spectral gaps A Andoni, A Naor, A Nikolov, I Razenshteyn, E Waingarten Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018 | 27 | 2018 |
| Hölder homeomorphisms and approximate nearest neighbors A Andoni, A Naor, A Nikolov, I Razenshteyn, E Waingarten 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 23 | 2018 |
| Boolean Unateness Testing with Õ (n^{3/4}) Adaptive Queries X Chen, E Waingarten, J Xie 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 16 | 2017 |
| Approximating the distance to monotonicity of Boolean functions RKS Pallavoor, S Raskhodnikova, E Waingarten Random Structures & Algorithms 60 (2), 233-260, 2022 | 15 | 2022 |
| 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 | 13 | 2019 |
| Nearly optimal edge estimation with independent set queries X Chen, A Levi, E Waingarten Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 10 | 2020 |
| Mario kart is hard J Bosboom, ED Demaine, A Hesterberg, J Lynch, E Waingarten Japanese Conference on Discrete and Computational Geometry and Graphs, 49-59, 2015 | 10 | 2015 |
| Lower bounds for tolerant junta and unateness testing via rejection sampling of graphs A Levi, E Waingarten arXiv preprint arXiv:1805.01074, 2018 | 9 | 2018 |
| Random restrictions of high dimensional distributions and uniformity testing with subcube conditioning CL Canonne, X Chen, G Kamath, A Levi, E Waingarten Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 7 | 2021 |
| Testing unateness nearly optimally X Chen, E Waingarten Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 7 | 2019 |
| Lower bounds on time-space trade-offs for approximate near neighbors A Andoni, T Laarhoven, I Razenshteyn, E Waingarten arXiv preprint arXiv:1605.02701, 2016 | 7 | 2016 |
| Playing dominoes is hard, except by yourself ED Demaine, F Ma, E Waingarten International Conference on Fun with Algorithms, 137-146, 2014 | 7 | 2014 |
| Learning and testing junta distributions with sub cube conditioning X Chen, R Jayaram, A Levi, E Waingarten Conference on Learning Theory, 1060-1113, 2021 | 6 | 2021 |
| On mean estimation for general norms with statistical queries J Li, A Nikolov, I Razenshteyn, E Waingarten Conference on Learning Theory, 2158-2172, 2019 | 6 | 2019 |
| The fewest clues problem ED Demaine, F Ma, A Schvartzman, E Waingarten, S Aaronson Theoretical Computer Science 748, 28-39, 2018 | 5 | 2018 |
| Adaptivity is exponentially powerful for testing monotonicity of halfspaces X Chen, RA Servedio, LY Tan, E Waingarten arXiv preprint arXiv:1706.05556, 2017 | 3 | 2017 |
