subexponential time algorithm / higher-dimensional peer-to-peer systems / algorithmic applications / constant approximation algorithm / approximation algorithm / height-i portals / proximity search / large networks / child portals / approximation algorithms / nearest-neighbor search / Linear time algorithms / /
Movie
W. iv / /
Organization
National Science Foundation / MIT / Computer Science Department / Carnegie Mellon University / Pittsburgh / /
Person
Satish B. Rao / Luca Trevisan / Philip N. Klein / Warren D. Smith / Kenneth L. Clarkson / Anupam Gupta / Christos Faloutsos / Jittat Fakcharoenphol / Nearest-Neighbor Methods / Farouk Kamoun / Lee-Ad Gottlieb / John Langford / Jon M. Kleinberg / Stavros G. Kolliopoulos / Goran Konjevod / Andrew Goldberg / Kunal Talwar / Robert Krauthgamer / Matthias Ruhl / Christos H. Papadimitriou / Stefan Arnborg / Artur Czumaj / Bernd-Uwe Pagel / Peter Grassberger / Itamar Procaccia / Andrzej Lingas / Flip Korn / Joseph S. B. Mitchell / Ittai Abraham / Dahlia Malkhi / Mihalis Yannakakis / David R. Karger / James R. Lee / Cyril Gavoille / Tom Wexler / Ibrahim Kamel / Sanjeev Arora / Alina Beygelzimer / Prabhakar Raghavan / Andrzej Proskurowski / Bruce M. Maggs / Alberto Belussi / K. Hildrum / Richard Cole / Hairong Zhao / Leonard Kleinrock / Satish Rao / Sham Kakade / Shuheng Zhou / H. Chan / Aleksandrs Slivkins / /