| Scalable Nearest Neighbor Search for Optimal Transport | 0 | 0.34 | 2020 |
| Non-Adaptive Adaptive Sampling on Turnstile Streams | 0 | 0.34 | 2020 |
| Learning Space Partitions for Nearest Neighbor Search | 0 | 0.34 | 2020 |
| Learning Sublinear-Time Indexing for Nearest Neighbor Search. | 0 | 0.34 | 2019 |
| On Mean Estimation for General Norms with Statistical Queries. | 0 | 0.34 | 2019 |
| Data-dependent hashing via nonlinear spectral gaps. | 3 | 0.38 | 2018 |
| Nonlinear dimension reduction via outer Bi-Lipschitz extensions. | 0 | 0.34 | 2018 |
| Hölder Homeomorphisms and Approximate Nearest Neighbors | 3 | 0.37 | 2018 |
| Approximate Nearest Neighbor Search in High Dimensions. | 10 | 0.75 | 2018 |
| Practical Data-Dependent Metric Compression with Provable Guarantees. | 0 | 0.34 | 2017 |
| Approximate Near Neighbors for General Symmetric Norms. | 2 | 0.39 | 2017 |
| Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching. | 0 | 0.34 | 2016 |
| Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. | 0 | 0.34 | 2016 |
| Optimal hashing-based time-space trade-offs for approximate near neighbors | 6 | 0.40 | 2016 |
| Weighted low rank approximations with provable guarantees. | 13 | 0.52 | 2016 |
| Practical and Optimal LSH for Angular Distance | 54 | 1.19 | 2015 |
| Optimal Data-Dependent Hashing for Approximate Near Neighbors. | 64 | 1.64 | 2015 |
| Sketching and Embedding are Equivalent for Norms. | 6 | 0.49 | 2014 |
| A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks | 0 | 0.34 | 2010 |
