11 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.DS2019★ 11 cited
Sample-Optimal Low-Rank Approximation of Distance Matrices
Piotr Indyk, Ali Vakilian, Tal Wagner +1
A distance matrix represents all pairwise distances, , between two point sets and in an arbit…
cs.DS2017★ 2 cited
Practical Data-Dependent Metric Compression with Provable Guarantees
Piotr Indyk, Ilya Razenshteyn, Tal Wagner
We introduce a new distance-preserving compact representation of multi-dimensional point-sets. Given points in a -dimensional space where each coordinate is represented usin…
cs.DS2015★ 1 cited
Towards Resistance Sparsifiers
Michael Dinitz, Robert Krauthgamer, Tal Wagner
We study resistance sparsification of graphs, in which the goal is to find a sparse subgraph (with reweighted edges) that approximately preserves the effective resistances between…