{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T20:10:26Z","timestamp":1791317426385,"version":"4.3.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319483139","type":"print"},{"value":"9783319483146","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-48314-6_21","type":"book-chapter","created":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T15:01:04Z","timestamp":1478185264000},"page":"323-339","source":"Crossref","is-referenced-by-count":15,"title":["Rumor Spreading with Bounded In-Degree"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Daum","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannic","family":"Maus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Daum, S., Kuhn, F., Maus, Y.: Rumor spreading with bounded in-degree. CoRR, abs\/1506.00828 (2015)","DOI":"10.1007\/978-3-319-48314-6_21"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J. Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database management. In: Proceedings of the Symposium on Principles of Distributed Computing (PODC), pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"issue":"4","key":"21_CR3","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"},{"issue":"1","key":"21_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"AM Frieze","year":"1985","unstructured":"Frieze, A.M., Grimmet, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10(1), 57\u201377 (1985)","journal-title":"Discrete Appl. Math."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 399\u2013408 (2010)","DOI":"10.1145\/1806689.1806745"},{"key":"21_CR6","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proceedings of the International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 57\u201368 (2011)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 565\u2013574 (2000)","DOI":"10.1109\/SFCS.2000.892324"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dorba, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 482\u2013491 (2003)","DOI":"10.1109\/SFCS.2003.1238221"},{"issue":"7","key":"21_CR9","doi-asserted-by":"crossref","first-page":"2997","DOI":"10.1109\/TIT.2008.924648","volume":"54","author":"D Mosk-Aoyama","year":"2008","unstructured":"Mosk-Aoyama, D., Shah, D.: Fast distributed algorithms for computing separable functions. IEEE Trans. Inf. Theor. 54(7), 2997\u20133007 (2008)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Chen, J., Pandurangan, G.: Optimal gossip-based aggregate computation. In: Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 124\u2013133 (2010)","DOI":"10.1145\/1810479.1810504"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Haeupler, B., Kelner, J.A., Maymounkov, P.: Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 961\u2013970 (2012)","DOI":"10.1145\/2213977.2214064"},{"issue":"6","key":"21_CR12","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1137\/110845380","volume":"41","author":"K Censor-Hillel","year":"2012","unstructured":"Censor-Hillel, K., Shachnai, H.: Fast information spreading in graphs with large weak conductance. SIAM J. Comput. 41(6), 1451\u20131465 (2012)","journal-title":"SIAM J. Comput."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in socal networks. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 1642\u20131660 (2012)","DOI":"10.1137\/1.9781611973099.130"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 1623\u20131641 (2012)","DOI":"10.1137\/1.9781611973099.129"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading with vertex expansion. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 801\u2013815 (2014)","DOI":"10.1137\/1.9781611973402.59"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Acan, H., Collevecchio, A., Mehrabian, A., Wormald, N.: On the push & pull protocol for rumour spreading. CoRR, abs\/1411.0948 (2014)","DOI":"10.1145\/2767386.2767416"},{"issue":"2","key":"21_CR17","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1214\/aoms\/1177700153","volume":"36","author":"V Strassen","year":"1965","unstructured":"Strassen, V.: The existence of probability measures with given marginals. Ann. Math. Stat. 36(2), 423\u2013439 (1965)","journal-title":"Ann. Math. Stat."},{"key":"21_CR18","volume-title":"Phase Transitions and Critical Phenomena","year":"2001","unstructured":"Domb, C., Lebowitz, J.L. (eds.): Phase Transitions and Critical Phenomena, vol. 18. Academic Press, London (2001)"},{"issue":"3","key":"21_CR19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01645980","volume":"36","author":"R Holley","year":"1974","unstructured":"Holley, R.: Remarks on the FKG inequalities. Commun. Math. Phys. 36(3), 227\u2013231 (1974)","journal-title":"Commun. Math. Phys."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48314-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T05:42:34Z","timestamp":1657604554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48314-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319483139","9783319483146"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48314-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}