Approximate distance oracles
Compact routing schemes
Compact oracles for reachability and approximate distances in planar digraphs
Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation
Priority sampling for estimation of arbitrary subset sums
Journal of the ACM
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
SIAM Journal on Computing
Uri Zwick
Carsten Lund
Yin Zhang
Nick Duffield
Bypassing the embedding
Beating CountSketch for heavy hitters in insertion streams
Continuous matrix approximation on distributed data
Metric embedding via shortest path decompositions