{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T17:05:58Z","timestamp":1750784758090,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,7,25]],"date-time":"2004-07-25T00:00:00Z","timestamp":1090713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,7,25]]},"DOI":"10.1145\/1011767.1011797","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"197-205","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Balanced binary trees for ID management and load balance in distributed hash tables"],"prefix":"10.1145","author":[{"given":"Gurmeet Singh","family":"Manku","sequence":"first","affiliation":[{"name":"Stanford University"}]}],"member":"320","published-online":{"date-parts":[[2004,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/838237.838599"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780626"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502054"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872056"},{"key":"e_1_3_2_1_6_1","first-page":"169","volume-title":"Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA 2004","author":"Ganesan P.","year":"2004","unstructured":"P. Ganesan and G. S. Manku . Optimal routing in Chord . In Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA 2004 ), pages 169 -- 178 , Jan. 2004 . P. Ganesan and G. S. Manku. Optimal routing in Chord. In Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA 2004), pages 169--178, Jan. 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003)","author":"Harvey N. J. A.","year":"2003","unstructured":"N. J. A. Harvey , M. Jones , S. Saroiu , M. Theimer , and A. Wolman . Skipnet: A scalable overlay network with practical locality properties . In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003) , 2003 . N. J. A. Harvey, M. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003), 2003."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.08.011"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"e_1_3_2_1_11_1","volume-title":"IRIS Student Workshop","author":"Karger D. R.","year":"2003","unstructured":"D. R. Karger and M. Ruhl . New algorithms for load balancing in peer-to-peer systems . IRIS Student Workshop , Aug. 2003 . D. R. Karger and M. Ruhl. New algorithms for load balancing in peer-to-peer systems. IRIS Student Workshop, Aug. 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes","author":"Leighton F. T.","year":"1992","unstructured":"F. T. Leighton . Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes . Academic Press\/Morgan Kaufmann , 1992 . F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes. Academic Press\/Morgan Kaufmann, 1992."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863999"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872054"},{"key":"e_1_3_2_1_17_1","first-page":"127","volume-title":"Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003","author":"Manku G. S.","year":"2003","unstructured":"G. S. Manku , M. Bawa , and P. Raghavan . Symphony: Distributed hashing in a small world . In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003 ), pages 127 -- 140 , 2003 . G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003), pages 127--140, 2003."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777421"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781042"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818784"}],"event":{"name":"PODC04: Principles of Distributed Computing 2004","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"St. John's Newfoundland Canada","acronym":"PODC04"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011797","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1011767.1011797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T20:13:41Z","timestamp":1748895221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7,25]]},"references-count":25,"alternative-id":["10.1145\/1011767.1011797","10.1145\/1011767"],"URL":"https:\/\/doi.org\/10.1145\/1011767.1011797","relation":{},"subject":[],"published":{"date-parts":[[2004,7,25]]},"assertion":[{"value":"2004-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}