The diameter of a long range percolation graph
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The diameter of a long-range percolation graph
Random Structures & Algorithms
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Close to optimal decentralized routing in long-range contact networks
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Long-range percolation mixing time
Combinatorics, Probability and Computing
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
Near optimal routing in a small-world network with augmented local awareness
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |