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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI