Finite metric spaces
Improved routing strategies with succinct tables
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
The One-Round Voronoi Game
Journal of Algorithms
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Proceedings of the eighteenth annual symposium on Computational geometry - SCG ’02
Discrete and Computational Geometry
Alex Samorodnitsky
Otfried Cheong
Amotz Bar-Noy
David Peleg
Sariel Har-Peled
Avi Wigderson
The Paulsen problem, continuous operator scaling, and smoothed analysis
Bypassing the embedding
Faster Algorithms for Computing Plurality Points