ACM - Normas
Kunal Talwar
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04
A tight bound on approximating arbitrary metrics by tree metrics
Compact and localized distributed data structures
On coresets for k-means and k-median clustering
New Orleans, Louisiana
Algorithms for dynamic geometric problems over data streams
Finding nearest neighbors in growth-restricted metrics