{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:39Z","timestamp":1725569739897},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_26","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T07:48:26Z","timestamp":1289375306000},"page":"279-291","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Broadcasting in Random Power Law Networks"],"prefix":"10.1007","author":[{"given":"Robert","family":"Els\u00e4sser","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Ogierman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"The Gnutella protocol specification v.0.4 (March 2001), http:\/\/www9.limewire.com\/developer\/gnutella_protocol_0.4.pdf"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Els\u00e4sser, R., Friedetzky, T.: Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In: Proceedings of PODC 2008, pp. 155\u2013164 (2008)","DOI":"10.1145\/1400751.1400773"},{"key":"26_CR3","first-page":"30","volume-title":"Peer-to-Peer Computing","author":"S.M. Botros","year":"2001","unstructured":"Botros, S.M., Waterhouse, S.R.: Search in jxta and other distributed networks. In: Graham, R.L., Shahmehri, N. (eds.) Peer-to-Peer Computing, pp. 30\u201335. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"6","key":"26_CR4","first-page":"2508","volume":"52","author":"S.P. Boyd","year":"2006","unstructured":"Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. Proceedings of IEEE\u00a052(6), 2508\u20132530 (2006)","journal-title":"Proceedings of IEEE"},{"key":"26_CR5","series-title":"Cambridge Series in Statistical and Probabilistic Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546594","volume-title":"Random Graph Dynamics","author":"R. Durrett","year":"2006","unstructured":"Durrett, R.: Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, New York (2006)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/11864219_26","volume-title":"Distributed Computing","author":"R. Els\u00e4sser","year":"2006","unstructured":"Els\u00e4sser, R.: On randomized broadcasting in power law networks. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 370\u2013384. Springer, Heidelberg (2006)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: Proceedings of SPAA 2006, pp. 148\u2013157 (2006)","DOI":"10.1145\/1148109.1148135"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11940128_36","volume-title":"Algorithms and Computation","author":"R. Els\u00e4sser","year":"2006","unstructured":"Els\u00e4sser, R., Sauerwald, T.: On the runtime and robustness of randomized broadcasting. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 349\u2013358. Springer, Heidelberg (2006)"},{"key":"26_CR9","unstructured":"Els\u00e4sser, R., Sauerwald, T.: The power of memory in randomized broadcasting. In: Proceedings of SODA 2008, pp. 218\u2013227 (2008)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publicationes Mathematicae, 290\u2013297 (1959)","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"26_CR11","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Science, 17\u201361 (1960)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-52921-7_62","volume-title":"Algorithms","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol.\u00a0450, pp. 128\u2013137. Springer, Heidelberg (1990)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A. Frieze","year":"1985","unstructured":"Frieze, A., Grimmett, G.: The shortest-path problem for graphs with random-arc-lengths. Discrete Applied Mathematics\u00a010, 57\u201377 (1985)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"26_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Inf. Process. Lett.\u00a033(6), 305\u2013308 (1990)","journal-title":"Inf. Process. Lett."},{"key":"26_CR15","unstructured":"Jovanovic, M., Annexstein, F., Berman, K.: Scalability issues in large p2p networks - a case study of Gnutella. Technical Report, University of Cincinatti (2003)"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings of FOCS 2000, p. 565 (2000)","DOI":"10.1109\/SFCS.2000.892324"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045, 167\u2013256 (2003)","journal-title":"SIAM Review"},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B. Pittel","year":"1987","unstructured":"Pittel, B.: On spreading a rumor. SIAM J. Appl. Math.\u00a047(1), 213\u2013223 (1987)","journal-title":"SIAM J. Appl. Math."},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-77120-3_19","volume-title":"Algorithms and Computation","author":"T. Sauerwald","year":"2007","unstructured":"Sauerwald, T.: On mixing and edge expansion properties in randomized broadcasting. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 196\u2013207. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T04:54:46Z","timestamp":1685854486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}