Bypassing the embedding
A tight bound on approximating arbitrary metrics by tree metrics
Cops, robbers, and threatening skeletons
The Limits of Two-Party Differential Privacy
Quincy
Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC ’03
Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC ’14
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles - SOSP ’09
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04
2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Satish Rao
Andrew McGregor
Michael Isard
Jittat Fakcharoenphol
Andrew Goldberg
Anupam Gupta
How robust are linear sketches to adaptive inputs?
TetriSched: Global Rescheduling with Adaptive Plan-ahead in Dynamic Heterogeneous Clusters
Metric embedding via shortest path decompositions