{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T13:24:59Z","timestamp":1772112299579,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,27]],"date-time":"2004-06-27T00:00:00Z","timestamp":1088294400000},"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,6,27]]},"DOI":"10.1145\/1007912.1007919","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"36-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":198,"title":["Simple efficient load balancing algorithms for peer-to-peer systems"],"prefix":"10.1145","author":[{"given":"David R.","family":"Karger","sequence":"first","affiliation":[{"name":"MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Ruhl","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780626"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946315"},{"key":"e_1_3_2_1_3_1","first-page":"384","volume-title":"Skip Graphs. In Proceedings SODA","author":"Aspnes J.","year":"2003","unstructured":"J. Aspnes and G. Shah . Skip Graphs. In Proceedings SODA , pages 384 -- 393 , Jan. 2003 . J. Aspnes and G. Shah. Skip Graphs. In Proceedings SODA, pages 384--393, Jan. 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687945"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315480"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"e_1_3_2_1_10_1","volume-title":"Consistent Hashing and Random Trees: Algorithms for Caching in Distributed Networks. Master's thesis","author":"Lewin D. M.","year":"1998","unstructured":"D. M. Lewin . Consistent Hashing and Random Trees: Algorithms for Caching in Distributed Networks. Master's thesis , Massachusetts Institute of Technology , May 1998 . D. M. Lewin. Consistent Hashing and Random Trees: Algorithms for Caching in Distributed Networks. Master's thesis, Massachusetts Institute of Technology, May 1998."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571863"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687801"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777421"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_19_1","first-page":"331","volume-title":"Proceedings SODA","author":"Schmidt J. P.","year":"1993","unstructured":"J. P. Schmidt , A. Siegel , and A. Srinivasan . Chernoff-Hoeffding bounds for applications with limited independence . In Proceedings SODA , pages 331 -- 340 , Jan. 1993 . J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. In Proceedings SODA, pages 331--340, Jan. 1993."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940876"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"}],"event":{"name":"SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004","location":"Barcelona Spain","acronym":"SPAA04","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007919","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007912.1007919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:39Z","timestamp":1750286619000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,27]]},"references-count":19,"alternative-id":["10.1145\/1007912.1007919","10.1145\/1007912"],"URL":"https:\/\/doi.org\/10.1145\/1007912.1007919","relation":{},"subject":[],"published":{"date-parts":[[2004,6,27]]},"assertion":[{"value":"2004-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}