{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:44:23Z","timestamp":1759333463312,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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,13]]},"DOI":"10.1145\/1007352.1007368","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"54-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":124,"title":["Know thy neighbor's neighbor"],"prefix":"10.1145","author":[{"given":"Gurmeet Singh","family":"Manku","sequence":"first","affiliation":[{"name":"Stanford University, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/838237.838599"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/BF01205489","article-title":"Discontinuity of the percolation density in one dimensional 1\/|x-y|2 percolation models","volume":"107","author":"Aizenman M.","year":"1986","unstructured":"M. Aizenman and C. M. Newman . Discontinuity of the percolation density in one dimensional 1\/|x-y|2 percolation models . Communications in Mathematical Physics , 107 : 611 -- 647 , 1986 . M. Aizenman and C. M. Newman. Discontinuity of the percolation density in one dimensional 1\/|x-y|2 percolation models. Communications in Mathematical Physics, 107:611--647, 1986.","journal-title":"Communications in Mathematical Physics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/571825.571862"},{"key":"e_1_3_2_1_4_1","first-page":"384","volume-title":"Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA 2003","author":"Aspnes J.","year":"2003","unstructured":"J. Aspnes and G. Shah . Skip graphs . In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA 2003 ), pages 384 -- 393 , Jan. 2003 . J. Aspnes and G. Shah. Skip graphs. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA 2003), pages 384--393, Jan. 2003."},{"key":"e_1_3_2_1_5_1","volume-title":"Linked: The New Science of Networks","author":"Barabasi A. L.","year":"2002","unstructured":"A. L. Barabasi . Linked: The New Science of Networks . Perseus Publishing , 2002 . A. L. Barabasi. Linked: The New Science of Networks. Perseus Publishing, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.5555\/645958.676120"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1002\/rsa.1022"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/3-540-37795-6_19"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1214\/aoms\/1177729330"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1002\/rsa.10042"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1126\/science.1081058"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/872035.872056"},{"key":"e_1_3_2_1_14_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."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/863955.863998"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/872035.872057"},{"key":"e_1_3_2_1_17_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."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-540-45172-3_9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/335305.335325"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/863955.863999"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/571825.571857"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/872035.872054"},{"key":"e_1_3_2_1_23_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."},{"issue":"1","key":"e_1_3_2_1_24_1","first-page":"60","article-title":"The small world problem","volume":"67","author":"Milgram S.","year":"1967","unstructured":"S. Milgram . The small world problem . Psychology Today , 67 ( 1 ): 60 -- 67 , May 1967 . S. Milgram. The small world problem. Psychology Today, 67(1):60--67, May 1967.","journal-title":"Psychology Today"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/777412.777421"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/978-3-540-30183-7_26"},{"key":"e_1_3_2_1_27_1","first-page":"483","article-title":"One dimensional 1\/|j-i|s percolation models: The existence of a transition for $sleq 2$","volume":"180","author":"Newman C. M.","year":"1986","unstructured":"C. M. Newman and L. S. Schulman . One dimensional 1\/|j-i|s percolation models: The existence of a transition for $sleq 2$ . Communications in Mathematical Physics , 180 : 483 -- 504 , 1986 . C. M. Newman and L. S. Schulman. One dimensional 1\/|j-i|s percolation models: The existence of a transition for $sleq 2$. Communications in Mathematical Physics, 180:483--504, 1986.","journal-title":"Communications in Mathematical Physics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1073\/pnas.012582999"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1016\/0378-8733(78)90010-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/78973.78977"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/383059.383072"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.5555\/646591.697650"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1088\/0305-4470\/16\/17\/001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_35_1","first-page":"440","volume-title":"Nature","author":"Watts D.","year":"1998","unstructured":"D. Watts and S. Strogatz . Collective dynamics of small-world networks . Nature , pages 440 -- 442 , 1998 . D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, pages 440--442, 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1145\/885651.781042"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1109\/JSAC.2003.818784"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC04","name":"STOC04: Symposium of Theory of Computing 2004","location":"Chicago IL USA"},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007368","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:55Z","timestamp":1750267435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007368"}},"subtitle":["the power of lookahead in randomized P2P networks"],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":36,"alternative-id":["10.1145\/1007352.1007368","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007368","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}