The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
IEEE Transactions on Parallel and Distributed Systems
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Adding random edges to dense graphs
Random Structures & Algorithms
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Routing complexity of faulty networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Close to optimal decentralized routing in long-range contact networks
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Robust network connectivity: when it's the big picture that matters
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Routing complexity of faulty networks
Random Structures & Algorithms
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
Local/Global Phenomena in Geometrically Generated Graphs
Algorithms and Models for the Web-Graph
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
Journal of the ACM (JACM)
A Survey of Statistical Network Models
Foundations and Trends® in Machine Learning
Deterministic decentralized search in random graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
The diameter of sparse random graphs
Combinatorics, Probability and Computing
Pegging graphs yields a small diameter
Combinatorics, Probability and Computing
The mixing time of the Newman: Watts small world
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
A case for random shortcut topologies for HPC interconnects
Proceedings of the 39th Annual International Symposium on Computer Architecture
A key-distribution mechanism for wireless sensor networks using Zig-Zag product
International Journal of Ad Hoc and Ubiquitous Computing
Complex contagion and the weakness of long ties in social networks: revisited
Proceedings of the fourteenth ACM conference on Electronic commerce
Agent-based interpretations of classic network models
Computational & Mathematical Organization Theory
| Hi-index | 0.00 |