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

Gurmeet Singh Manku. Balanced binary trees for ID management and load balance in distributed hash tables. In Soma Chaudhuri, Shay Kutten, editors, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John s, Newfoundland, Canada, July 25-28, 2004. pages 197-205, ACM, 2004. [doi]

@inproceedings{Manku04,
  title = {Balanced binary trees for ID management and load balance in distributed hash tables},
  author = {Gurmeet Singh Manku},
  year = {2004},
  doi = {10.1145/1011767.1011797},
  url = {http://doi.acm.org/10.1145/1011767.1011797},
  researchr = {https://researchr.org/publication/Manku04},
  cites = {0},
  citedby = {0},
  pages = {197-205},
  booktitle = {Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John s, Newfoundland, Canada, July 25-28, 2004},
  editor = {Soma Chaudhuri and Shay Kutten},
  publisher = {ACM},
  isbn = {1-58113-802-4},
}