| 2026 | SODA | Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness. | Sanjeev Khanna, Ashwin Padaki, Erik Waingarten |
| 2026 | SODA | Streaming and Massively Parallel Algorithms for Euclidean Max-Cut. | Nicolas Menand, Erik Waingarten |
| 2026 | STOC | Near-Optimal Directed Euclidean Spanners in High Dimensions. | Rajesh Jayaram, Shyamal Patel, Clifford Stein, Erik Waingarten, Tian Zhang |
| 2025 | FOCS | Average Distortion Sketching. | Yiqiao Bao, Anubhav Baweja, Nicolas Menand, Erik Waingarten, Nathan White, Tian Zhang |
| 2025 | FOCS | Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair. | Lorenzo Beretta, Vincent Cohen-Addad, Rajesh Jayaram, Erik Waingarten |
| 2025 | FOCS | Instance-Optimal Uniformity Testing and Tracking. | Guy Blanc, Clment L. Canonne, Erik Waingarten |
| 2025 | FOCS | A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams. | Sanjeev Khanna, Ashwin Padaki, Krish Singal, Erik Waingarten |
| 2025 | ICML | Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures. | Jie Gao, Rajesh Jayaram, Benedikt Kolbe, Shay Sapir, Chris Schwiegelshohn, Sandeep Silwal, Erik Waingarten |
| 2025 | SODA | Lower Bounds for Convexity Testing. | Xi Chen, Anindya De, Shivam Nadimpalli, Rocco A. Servedio, Erik Waingarten |
| 2025 | SODA | Nearly Tight Bounds on Testing of Metric Properties. | Yiqiao Bao, Sampath Kannan, Erik Waingarten |
| 2025 | SODA | The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction. | Moses Charikar, Erik Waingarten |
| 2025 | STOC | Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. | Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten |
| 2024 | SODA | A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations. | Moses Charikar, Michael Kapralov, Erik Waingarten |
| 2024 | STOC | Data-Dependent LSH for the Earth Mover's Distance. | Rajesh Jayaram, Erik Waingarten, Tian Zhang |
| 2023 | COLT | Fast Algorithms for a New Relaxation of Optimal Transport. | Moses Charikar, Beidi Chen, Christopher R, Erik Waingarten |
| 2023 | STOC | Streaming Euclidean MST to a Constant Factor. | Xi Chen, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten |
| 2022 | ICALP | Finding Monotone Patterns in Sublinear Time, Adaptively. | Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten |
| 2022 | ICALP | Polylogarithmic Sketches for Clustering. | Moses Charikar, Erik Waingarten |
| 2022 | STOC | New streaming algorithms for high dimensional EMD and MST. | Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten |
| 2021 | COLT | Learning and testing junta distributions with sub cube conditioning. | Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten |
| 2021 | SODA | Approximate Nearest Neighbors Beyond Space Partitions. | Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2021 | SODA | Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning. | Clment L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten |
| 2020 | SODA | Nearly optimal edge estimation with independent set queries. | Xi Chen, Amit Levi, Erik Waingarten |
| 2020 | SODA | Approximating the Distance to Monotonicity of Boolean Functions. | Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten |
| 2019 | COLT | On Mean Estimation for General Norms with Statistical Queries. | Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2019 | FOCS | Finding Monotone Patterns in Sublinear Time. | Omri Ben-Eliezer, Clment L. Canonne, Shoham Letzter, Erik Waingarten |
| 2019 | STOC | Testing unateness nearly optimally. | Xi Chen, Erik Waingarten |
| 2018 | FOCS | Hlder Homeomorphisms and Approximate Nearest Neighbors. | Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2018 | STOC | Data-dependent hashing via nonlinear spectral gaps. | Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2017 | FOCS | Boolean Unateness Testing with (n | Xi Chen, Erik Waingarten, Jinyu Xie |
| 2017 | SODA | Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. | Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten |
| 2017 | STOC | Approximate near neighbors for general symmetric norms. | Alexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2017 | STOC | Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness. | Xi Chen, Erik Waingarten, Jinyu Xie |
| 2016 | FUN | The Fewest Clues Problem. | Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson |
| 2014 | FUN | Playing Dominoes Is Hard, Except by Yourself. | Erik D. Demaine, Fermi Ma, Erik Waingarten |