{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:24:40Z","timestamp":1725661480316},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,30]]},"DOI":"10.1145\/1148109.1148162","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:04:00Z","timestamp":1161194640000},"page":"308-317","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Distributed random digraph transformations for peer-to-peer networks"],"prefix":"10.1145","author":[{"given":"Peter","family":"Mahlmann","sequence":"first","affiliation":[{"name":"University of Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schindelhauer","sequence":"additional","affiliation":[{"name":"University of Freiburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"30","volume-title":"Proceedings of the 1st International Conference on Peer-to-Peer Computing (P2P 2001","author":"Botros S. M.","year":"2001","unstructured":"S. M. Botros and S. R. Waterhouse . Search in jxta and other distributed networks . In Proceedings of the 1st International Conference on Peer-to-Peer Computing (P2P 2001 ), pages 30 -- 35 , 2001 . S. M. Botros and S. R. Waterhouse. Search in jxta and other distributed networks. In Proceedings of the 1st International Conference on Peer-to-Peer Computing (P2P 2001), pages 30--35, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.5555\/1070432.1070574"},{"unstructured":"T. Feder A. Guetz M. Mihail and A. Saberi. The flip markov chain and peer-to-peer networks. http:\/\/www.stanford.edu\/~saberi\/switch.pdf 2006.  T. Feder A. Guetz M. Mihail and A. Saberi. The flip markov chain and peer-to-peer networks. http:\/\/www.stanford.edu\/~saberi\/switch.pdf 2006.","key":"e_1_3_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/INFCOM.2004.1354487"},{"unstructured":"Gnutella. The gnutella protocol specification v0.4.  Gnutella. The gnutella protocol specification v0.4.","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/564870.564877"},{"key":"e_1_3_2_1_7_1","volume-title":"Annex stein, and K. A. Berman. Scalability issues in large peer-to-peer networks -- a case study of Gnutella. Technical report","author":"Jovanovic M. A.","year":"2001","unstructured":"M. A. Jovanovic , F. S. Annex stein, and K. A. Berman. Scalability issues in large peer-to-peer networks -- a case study of Gnutella. Technical report , University of Cincinnati , 2001 . M. A. Jovanovic, F. S. Annex stein, and K. A. Berman. Scalability issues in large peer-to-peer networks -- a case study of Gnutella. Technical report, University of Cincinnati, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"e_1_3_2_1_9_1","volume-title":"IEEE INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies","author":"Kim M.","year":"2004","unstructured":"M. Kim and M. Medard . Robustness in large-scale random networks . In IEEE INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies , Mar. 2004 . M. Kim and M. Medard. Robustness in large-scale random networks. In IEEE INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Mar. 2004."},{"unstructured":"M. Kim M. Medard and E. A. M. Torres. On reliability of large-scale random networks. http:\/\/web.mit.edu\/minkyu\/www\/doc\/ToNsubmitted.pdf 2005.  M. Kim M. Medard and E. A. M. Torres. On reliability of large-scale random networks. http:\/\/web.mit.edu\/minkyu\/www\/doc\/ToNsubmitted.pdf 2005.","key":"e_1_3_2_1_10_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/514191.514206"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1073970.1073992"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/777412.777421"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/874063.875584"},{"key":"e_1_3_2_1_15_1","first-page":"99","volume-title":"Proceedings of the 1st International Conference on Peer-to-Peer Computing (P2P 2001","author":"Ripeanu M.","year":"2001","unstructured":"M. Ripeanu . Peer-to-peer architecture case study: Gnutella network . In Proceedings of the 1st International Conference on Peer-to-Peer Computing (P2P 2001 ), pages 99 -- 100 , 2001 . M. Ripeanu. Peer-to-peer architecture case study: Gnutella network. In Proceedings of the 1st International Conference on Peer-to-Peer Computing (P2P 2001), pages 99--100, 2001."},{"unstructured":"J. Ritter. Why gnutella can't scale. http:\/\/www.darkridge.com\/~jpr5\/doc\/gnutella.html 2001.  J. Ritter. Why gnutella can't scale. http:\/\/www.darkridge.com\/~jpr5\/doc\/gnutella.html 2001.","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_18_1","volume-title":"Surveys in Combinatorics","author":"Wormald N. C.","year":"1993","unstructured":"N. C. Wormald . Models of random regular graphs . In Surveys in Combinatorics , 1993 , Walker (Ed.), London Mathematical Society Lecture Note Series 187, Cambridge University Press . 1999. N. C. Wormald. Models of random regular graphs. In Surveys in Combinatorics, 1993, Walker (Ed.), London Mathematical Society Lecture Note Series 187, Cambridge University Press. 1999."}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"acronym":"SPAA06","name":"SPAA06: 18th ACM Symposium on Parallelism in Algorithms and Architectures 2006","location":"Cambridge Massachusetts USA"},"container-title":["Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1148109.1148162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T11:20:35Z","timestamp":1673349635000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,30]]},"references-count":18,"alternative-id":["10.1145\/1148109.1148162","10.1145\/1148109"],"URL":"https:\/\/doi.org\/10.1145\/1148109.1148162","relation":{},"subject":[],"published":{"date-parts":[[2006,7,30]]},"assertion":[{"value":"2006-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}