papers
Publications (9)
cs.DS2017
Practical Data-Dependent Metric Compression with Provable Guarantees
Piotr Indyk, Ilya Razenshteyn, Tal Wagner
cs.DS2019
Scalable Fair Clustering
Arturs Backurs, Piotr Indyk, Krzysztof Onak +3
cs.DM2017
A Graph-Theoretic Approach to Multitasking
Noga Alon, Jonathan D. Cohen, Biswadip Dey +6
cs.CG2016
Near-Optimal (Euclidean) Metric Compression
Piotr Indyk, Tal Wagner
cs.DS2018
Multitasking Capacity: Hardness Results and Improved Constructions
Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths +5
cs.DS2019
Sample-Optimal Low-Rank Approximation of Distance Matrices
Piotr Indyk, Ali Vakilian, Tal Wagner +1
cs.DS2018
Approximate Nearest Neighbors in Limited Space
Piotr Indyk, Tal Wagner
cs.DS2015
Towards Resistance Sparsifiers
Michael Dinitz, Robert Krauthgamer, Tal Wagner
cs.DS2016
Cheeger-type approximation for sparsest $st$-cut
Robert Krauthgamer, Tal Wagner