{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:12:08Z","timestamp":1777540328982,"version":"3.51.4"},"reference-count":13,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5793,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1990,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.<\/jats:p>","DOI":"10.1002\/rsa.3240010406","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T18:18:31Z","timestamp":1180203511000},"page":"447-460","source":"Crossref","is-referenced-by-count":146,"title":["Randomized broadcast in networks"],"prefix":"10.1002","volume":"1","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"R.Aleliunas R. M.Karp R. J.Lipton L.Lov\u00e1sz andC.Rackoff Random walks universal traversal sequences and the complexity of maze problems in 20th Annual Symposium on Foundations of Computer Science San Juan Puerto Rico October1979 pp.218\u2013223.","DOI":"10.1109\/SFCS.1979.34"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"A. Z.BroderandA. R.Karlin Bounds on covering times in 29th Annual Symposium on Foundations of Computer Science White Plains NY October1988 pp.479\u2013487.","DOI":"10.1109\/SFCS.1988.21964"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.2307\/2043545"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"A. K.Chandra P.Raghavan W. L.Ruzzo R.Smolensky andP.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 Seattle WA May1989 pp.574\u2013586.","DOI":"10.1145\/73007.73062"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"A.Demers D.Greene C.Hauser W.Irish J.Larson S.Shenker H.Sturgis D.Swinehart andD.Terry Epidemic algorithms for replicated database management in 6th ACM Symposium on Principles of Distributed Computing 1987 pp.1\u201312.","DOI":"10.1145\/41840.41841"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erd\u00f3s P.","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02066689"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1038\/204225a0"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180406"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02476383"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/0147013"}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240010406","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240010406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T18:57:21Z","timestamp":1698001041000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240010406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["10.1002\/rsa.3240010406"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240010406","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}