Efficient search for approximate nearest neighbor in high dimensional spaces
A better lower bound for on-line scheduling
Fairness in Routing and Load Balancing
Journal of Computer and System Sciences
Information Processing Letters
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Jon Kleinberg
Howard Karloff
Eyal Kushilevitz
Éva Tardos
Yair Bartal
Rafail Ostrovsky
Online load balancing on related machines
Efficient distributed locality sensitive hashing
A unified approach to scheduling on unrelated parallel machines