{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T22:45:54Z","timestamp":1697064354473},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T00:00:00Z","timestamp":1389744000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00453-013-9861-5","type":"journal-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T17:11:17Z","timestamp":1389719477000},"page":"467-492","source":"Crossref","is-referenced-by-count":2,"title":["Communication Complexity of Quasirandom Rumor Spreading"],"prefix":"10.1007","volume":"72","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[]},{"given":"Robert","family":"Els\u00e4sser","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,15]]},"reference":[{"key":"9861_CR1","first-page":"155","volume-title":"Proc. of PODC\u201908","author":"P. Berenbrink","year":"2008","unstructured":"Berenbrink, P., Els\u00e4sser, R., Friedetzky, T.: Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In: Proc. of PODC\u201908, pp. 155\u2013164 (2008)"},{"key":"9861_CR2","first-page":"306","volume-title":"Proc. of LATIN\u201910","author":"P. Berenbrink","year":"2010","unstructured":"Berenbrink, P., Els\u00e4sser, R., Sauerwald, T.: Randomised broadcasting: memory vs. randomness. In: Proc. of LATIN\u201910, pp. 306\u2013319 (2010)"},{"key":"9861_CR3","first-page":"134","volume-title":"Proc. of ESA\u201910","author":"P. Berenbrink","year":"2010","unstructured":"Berenbrink, P., Els\u00e4sser, R., Sauerwald, T.: Communication complexity of quasirandom rumor spreading. In: Proc. of ESA\u201910, pp. 134\u2013145 (2010)"},{"key":"9861_CR4","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press, San Diego (1985)"},{"key":"9861_CR5","first-page":"399","volume-title":"Proc. of STOC\u201910","author":"F. Chierichetti","year":"2010","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proc. of STOC\u201910, pp. 399\u2013408 (2010)"},{"key":"9861_CR6","first-page":"1","volume-title":"Proc. of PODC\u201987","author":"A. Demers","year":"1987","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc. of PODC\u201987, pp. 1\u201312 (1987)"},{"key":"9861_CR7","first-page":"773","volume-title":"Proc. of SODA\u201908","author":"B. Doerr","year":"2008","unstructured":"Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading. In: Proc. of SODA\u201908, pp.\u00a0773\u2013781 (2008)"},{"key":"9861_CR8","first-page":"366","volume-title":"Proc. of ICALP\u201909","author":"B. Doerr","year":"2009","unstructured":"Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading: expanders, push vs. pull, and robustness. In: Proc. of ICALP\u201909, pp. 366\u2013377 (2009)"},{"key":"9861_CR9","first-page":"148","volume-title":"Proc. of SPAA\u201906","author":"R. Els\u00e4sser","year":"2006","unstructured":"Els\u00e4sser, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: Proc. of SPAA\u201906, pp. 148\u2013157 (2006)"},{"key":"9861_CR10","first-page":"218","volume-title":"Proc. of SODA\u201908","author":"R. Els\u00e4sser","year":"2008","unstructured":"Els\u00e4sser, R., Sauerwald, T.: The power of memory in randomized broadcasting. In: Proc. of SODA\u201908, pp. 218\u2013227 (2008)"},{"key":"9861_CR11","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. (Debr.) 6, 290\u2013297 (1959)","journal-title":"Publ. Math. (Debr.)"},{"issue":"4","key":"9861_CR12","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Struct. Algorithms 1(4), 447\u2013460 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"9861_CR13","first-page":"2552","volume-title":"Proc. of INFOCOM\u201910","author":"N. Fountoulakis","year":"2010","unstructured":"Fountoulakis, N., Huber, A., Panagiotou, K.: Reliable broadcasting in random networks and the effect of density. In: Proc. of INFOCOM\u201910, pp. 2552\u20132560 (2010)"},{"key":"9861_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A.M. Frieze","year":"1985","unstructured":"Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10, 57\u201377 (1985)","journal-title":"Discrete Appl. Math."},{"key":"9861_CR15","first-page":"57","volume-title":"Proc. of STACS\u201911","author":"G. Giakkoupis","year":"2011","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proc. of STACS\u201911, pp. 57\u201368 (2011)"},{"issue":"6","key":"9861_CR16","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"36","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Inf. Process. Lett. 36(6), 305\u2013308 (1990)","journal-title":"Inf. Process. Lett."},{"key":"9861_CR17","first-page":"565","volume-title":"Proc. of FOCS\u201900","author":"R. Karp","year":"2000","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proc. of FOCS\u201900, pp. 565\u2013574 (2000)"},{"key":"9861_CR18","series-title":"London Mathematical Society Lectures Note Series","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1017\/CBO9781107359949.008","volume-title":"Surveys in Combinatorics, 1989","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Siemons, J. (ed.) Surveys in Combinatorics, 1989. London Mathematical Society Lectures Note Series, vol. 141, pp. 148\u2013188. Cambridge University Press, Cambridge (1989)"},{"key":"9861_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"issue":"1","key":"9861_CR20","doi-asserted-by":"crossref","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. 47(1), 213\u2013223 (1987)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9861-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9861-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9861-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T20:11:24Z","timestamp":1688933484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9861-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,15]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9861"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9861-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,15]]}}}