Follow
Erik Waingarten
Erik Waingarten
Stanford University
Verified email at cs.columbia.edu - Homepage
Title
Cited by
Cited by
Year
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
1372017
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
552017
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
382017
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
302018
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
302018
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
292018
Approximating the distance to monotonicity of Boolean functions
RKS Pallavoor, S Raskhodnikova, E Waingarten
Random Structures & Algorithms 60 (2), 233-260, 2022
182022
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
172017
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
152021
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
152019
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
142020
Learning and testing junta distributions with sub cube conditioning
X Chen, R Jayaram, A Levi, E Waingarten
Conference on Learning Theory, 1060-1113, 2021
122021
On mean estimation for general norms with statistical queries
J Li, A Nikolov, I Razenshteyn, E Waingarten
Conference on Learning Theory, 2158-2172, 2019
92019
Lower bounds for tolerant junta and unateness testing via rejection sampling of graphs
A Levi, E Waingarten
arXiv preprint arXiv:1805.01074, 2018
92018
Mario kart is hard
J Bosboom, ED Demaine, A Hesterberg, J Lynch, E Waingarten
Discrete and Computational Geometry and Graphs: 18th Japan Conference …, 2016
92016
Testing unateness nearly optimally
X Chen, E Waingarten
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
82019
New streaming algorithms for high dimensional EMD and MST
X Chen, R Jayaram, A Levi, E Waingarten
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
72022
The fewest clues problem
ED Demaine, F Ma, A Schvartzman, E Waingarten, S Aaronson
Theoretical Computer Science 748, 28-39, 2018
62018
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
62016
Playing dominoes is hard, except by yourself
ED Demaine, F Ma, E Waingarten
Fun with Algorithms: 7th International Conference, FUN 2014, Lipari Island …, 2014
62014
The system can't perform the operation now. Try again later.
Articles 1–20