ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Balanced binary trees for ID management and load balance in distributed hash tables

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: Gurmeet Singh Manku Stanford University
Published in:
Cover Image
 
· Proceeding
PODC '04 Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
ACM New York, NY, USA ©2004
table of contents ISBN:1-58113-802-4 doi>10.1145/1011767.1011797
Balanced binary trees for ID management and load balance in distributed hash tables Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 36
· Citation Count: 18


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder