Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMay 2009
Tight lower bounds for greedy routing in uniform small world rings
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computingPages 591–600https://doi.org/10.1145/1536414.1536494We consider augmented ring-based networks with vertices 0,...,n-1, where each vertex is connected to its left and right neighbor and possibly to some further vertices (called long range contacts). The outgoing edges of a vertex v are obtained by ...
- posterMay 2007
Building small worlds in unstructured P2P networks using a multiagent Bayesian inference mechanism
AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systemsArticle No.: 144, Pages 1–3https://doi.org/10.1145/1329125.1329300Over the past few years, peer-to-peer(p2p) unstructured networks have emerged as an attractive paradigm for enabling online interactions between a large number of users in a decentralized manner. However, the decentralized nature of unstructured p2p ...
- ArticleJuly 2004
Eclecticism shrinks even small worlds
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computingPages 169–178https://doi.org/10.1145/1011767.1011793We consider small world graphs as defined by Kleinberg (2000), i.e., graphs obtained from a d-dimensional mesh by adding links chosen at random according to the d-harmonic distribution. This model aims at giving formal support to the "six degrees of ...