Outward rotations
Approximate distance oracles
Compact routing schemes
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures - SPAA ’01
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC ’99
Mikkel Thorup
Approximating the cut-norm via Grothendieck’s inequality
Bypassing the embedding