{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:57Z","timestamp":1725663357629},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540529217"},{"type":"electronic","value":"9783540471776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52921-7_62","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:47:32Z","timestamp":1330206452000},"page":"128-137","source":"Crossref","is-referenced-by-count":29,"title":["Randomized broadcast in networks"],"prefix":"10.1007","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lov\u00e1sz, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science, pages 218\u2013223, San Juan, Puerto Rico, October 1979.","DOI":"10.1109\/SFCS.1979.34"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"A.Z. Broder and A.R. Karlin. Bounds on covering times. In 29th Annual Symposium on Foundations of Computer Science, pages 479\u2013487, White Plains, NY, October 1988.","DOI":"10.1109\/SFCS.1988.21964"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat., 23:493\u2013509, 1952.","journal-title":"Annals of Math. Stat."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"A. K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 574\u2013586, Seattle, May 1989.","DOI":"10.1145\/73007.73062"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database management. In 6th ACM Symp. on Principles of Distributed Computing, pages 1\u201312, 1987.","DOI":"10.1145\/41840.41841"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A.M. Frieze","year":"1985","unstructured":"A.M. Frieze and G.R. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Math., 10:57\u201377, 1985.","journal-title":"Discrete Applied Math."},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1038\/204225a0","volume":"204","author":"W. Goffman","year":"1964","unstructured":"W. Goffman and V.A. Newill. Generalization of epidemic theory \u2014 an application to the transmission of ideas. Nature, 204:225\u2013228, 1964.","journal-title":"Nature"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1988","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319\u2013349, 1988.","journal-title":"Networks"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02476383","volume":"15","author":"H.G. Landau","year":"1953","unstructured":"H.G. Landau and A. Rapoport. Contribution to the mathematical theory of contagion and spread of information: I. spread through a thoroughly mixed population. Bull. Math. Biophys., 15:173\u2013183, 1953.","journal-title":"Bull. Math. Biophys."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B.M. Pittel","year":"1987","unstructured":"B.M. Pittel. On spreading a rumour. SIAM J. Applied Math., 47:213\u2013223, 1987.","journal-title":"SIAM J. Applied Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52921-7_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:45Z","timestamp":1605648345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52921-7_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540529217","9783540471776"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-52921-7_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}