{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:10:03Z","timestamp":1762917003858},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,23]]},"DOI":"10.1145\/1146381.1146403","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"133-142","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["On the topologies formed by selfish peers"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Moscibroda","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Rogert","family":"Wattenhofer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2006,7,23]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1007\/11558989_16"},{"key":"e_1_3_2_1_2_1","first-page":"550","volume-title":"Proc. 15 th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Abraham I.","year":"2004","unstructured":"I. Abraham , D. Malkhi , and O. Dobzinski . LAND: Stretch (1 + e) Locality Aware Networks for DHTs . In Proc. 15 th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 550 -- 559 , 2004 . I. Abraham, D. Malkhi, and O. Dobzinski. LAND: Stretch (1 + e) Locality Aware Networks for DHTs. In Proc. 15 th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 550--559, 2004."},{"key":"e_1_3_2_1_3_1","volume-title":"Free Riding on Gnutella. First Monday, 5(10)","author":"Adar E.","year":"2000","unstructured":"E. Adar and B. Huberman . Free Riding on Gnutella. First Monday, 5(10) , 2000 . E. Adar and B. Huberman. Free Riding on Gnutella. First Monday, 5(10), 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/1109557.1109568"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1080192.1080198"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/FOCS.2004.68"},{"key":"e_1_3_2_1_7_1","first-page":"762","volume-title":"Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Chan H. T.-H.","year":"2005","unstructured":"H. T.-H. Chan , A. Gupta , B. M. Maggs , and S. Zhou . On Hierarchical Routing in Doubling Metrics . In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 762 -- 771 , 2005 . H. T.-H. Chan, A. Gupta, B. M. Maggs, and S. Zhou. On Hierarchical Routing in Doubling Metrics. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 762--771, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1073814.1073833"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/941079.941081"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/872035.872088"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_12_1","volume-title":"A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability , A Guide to the Theory of NP-Completeness . W. H. Freeman and Company , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1080192.1080199"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/509907.510013"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/380752.380883"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1060590.1060598"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/258492.258523"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.5555\/646591.697650"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1080091.1080103"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/11558989_17"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1109\/JSAC.2003.818784"}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"PODC06","name":"PODC06: ACM Symposium on Principles of Distributed Computing 2006","location":"Denver Colorado USA"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1146381.1146403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T23:59:51Z","timestamp":1673481591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1146381.1146403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,23]]},"references-count":21,"alternative-id":["10.1145\/1146381.1146403","10.1145\/1146381"],"URL":"https:\/\/doi.org\/10.1145\/1146381.1146403","relation":{},"subject":[],"published":{"date-parts":[[2006,7,23]]},"assertion":[{"value":"2006-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}