| No. |
Title |
Author |
Year |
| 1 |
Polylogarithmic Sketches for Clustering |
Charikar, Moses et al. |
2022 |
| 2 |
A Model for Ant Trail Formation and its Convergence Properties (Extended Abstract) |
Charikar, Moses et al. |
2021 |
| 3 |
The One-Way Communication Complexity of Dynamic Time Warping Distance |
Braverman, Vladimir et al. |
2019 |
| 4 |
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier |
Charikar, Moses et al. |
2018 |
| 5 |
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings |
Charikar, Moses et al. |
2018 |
| 6 |
Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers |
Steinhardt, Jacob et al. |
2018 |
| 7 |
Min-Cost Bipartite Perfect Matching with Delays |
Ashlagi, Itai et al. |
2017 |
| 8 |
On Approximating Target Set Selection |
Charikar, Moses et al. |
2016 |
| 9 |
Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk) |
Charikar, Moses S. |
2015 |
| 10 |
The Hardness of Approximation of Euclidean k-Means |
Awasthi, Pranjal et al. |
2015 |
