Hybrid search schemes for unstructured peer-to-peer networks
Authors:
- C. GkantsidisCGC. Gkantsidis
- M. MihailMMM. Mihail
- A. SaberiASA. Saberi
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1526-1537
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- The cover time of sparse random graphsRandom Structures & Algorithms, 2006
- A decentralized algorithm for spectral analysis2004
- Know thy neighbor's neighbor2004
- Spectral analysis of Internet topologies2004
- Fastest Mixing Markov Chain on a GraphSIAM Review, 2004
- Conductance and congestion in power law graphs2003
- A Chernoff Bound for Random Walks on Expander GraphsSIAM Journal on Computing, 1998
- Ten Lectures on the Probabilistic Method1994
- How to recycle random bits1989
- The diameter of random regular graphsCombinatorica, 1982