{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:45:01Z","timestamp":1725763501322},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_42","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"446-456","source":"Crossref","is-referenced-by-count":0,"title":["Faster Rumor Spreading with Multiple Calls"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Panagiotou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pourmiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","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: Proc.\u00a027th Symp. Principles of Distributed Computing (PODC), pp. 155\u2013164 (2008)","DOI":"10.1145\/1400751.1400773"},{"key":"42_CR2","unstructured":"Berger, N., Borgs, C., Chayes, J., Saberi, A.: On the Spread of Viruses on the Internet. In: Proc.\u00a016th Symp. Discrete Algorithms (SODA), pp. 301\u2013310 (2005)"},{"issue":"6","key":"42_CR3","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S. Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory\u00a052(6), 2508\u20132530 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Shachnai, H.: Partial information spreading with application to distributed maximum coverage. In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, pp. 161\u2013170 (2010)","DOI":"10.1145\/1835698.1835739"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proc.\u00a042nd Symp. Theory of Computing (STOC), pp. 399\u2013408 (2010)","DOI":"10.1145\/1806689.1806745"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/15427951.2004.10129081","volume":"1","author":"F.R.K. Chung","year":"2003","unstructured":"Chung, F.R.K., Lu, L.: The average distance in a random graph with given expected degrees. Internet Mathematics\u00a01(1), 91\u2013113 (2003)","journal-title":"Internet Mathematics"},{"issue":"2","key":"42_CR7","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TNET.2012.2204407","volume":"21","author":"A.E.F. Clementi","year":"2013","unstructured":"Clementi, A.E.F., Pasquale, F., Silvestri, R.: Opportunistic manets: Mobility can make up for low transmission power. IEEE\/ACM Trans. Netw.\u00a021(2), 610\u2013620 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"42_CR8","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 maintenance. In: Proc.\u00a06th Symp. Principles of Distributed Computing (PODC), pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-22012-8_40","volume-title":"Automata, Languages and Programming","author":"B. Doerr","year":"2011","unstructured":"Doerr, B., Fouz, M.: Asymptotically optimal randomized rumor spreading. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 502\u2013513. Springer, Heidelberg (2011)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: Proc.\u00a043rd Symp. Theory of Computing (STOC), pp. 21\u201330 (2011)","DOI":"10.1145\/1993636.1993640"},{"issue":"4","key":"42_CR11","doi-asserted-by":"publisher","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 Structures and Algorithms\u00a01(4), 447\u2013460 (1990)","journal-title":"Random Structures and Algorithms"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Huber, A., Panagiotou, K.: Reliable broadcasting in random networks and the effect of density. In: Proc.\u00a029th IEEE Conf. Computer Communications (INFOCOM), pp. 2552\u20132560 (2010)","DOI":"10.1109\/INFCOM.2010.5462084"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks. In: Proc.\u00a023rd Symp. Discrete Algorithms (SODA), pp. 1642\u20131660 (2012)","DOI":"10.1137\/1.9781611973099.130"},{"key":"42_CR14","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"},{"key":"42_CR15","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proc.\u00a028th Symp. Theoretical Aspects of Computer Science (STACS), pp. 57\u201368 (2011)"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading with vertex expansion. In: Proc.\u00a025th Symp. Discrete Algorithms, SODA (to appear, 2014)","DOI":"10.1137\/1.9781611973402.59"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Harchol-Balter, M., Leighton, F.T., Lewin, D.: Resource discovery in distributed networks. In: Proc.\u00a018th Symp. Principles of Distributed Computing (PODC), pp. 229\u2013237 (1999)","DOI":"10.1145\/301308.301362"},{"key":"42_CR18","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized Rumor Spreading. In: Proc.\u00a041st Symp. Foundations of Computer Science (FOCS), pp. 565\u2013574 (2000)"},{"key":"42_CR19","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc.\u00a044th Symp. Foundations of Computer Science (FOCS), pp. 482\u2013491 (2003)"},{"issue":"7","key":"42_CR20","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a054(7), 2997\u20133007 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Peres, Y., Sinclair, A., Sousi, P., Stauffer, A.: Mobile geometric graphs: Detection, coverage and percolation. In: Proc.\u00a022nd Symp. Discrete Algorithms (SODA), pp. 412\u2013428 (2011)","DOI":"10.1137\/1.9781611973082.33"},{"issue":"1","key":"42_CR22","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 Journal on Applied Mathematics\u00a047(1), 213\u2013223 (1987)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"van Renesse, R., Minsky, Y., Hayden, M.: A gossip-style failure detection service. In: Proceedings of the 15th IFIP International Conference on Distributed Systems Platforms, Middleware 1998, pp. 55\u201370 (1998)","DOI":"10.1007\/978-1-4471-1283-9_4"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T10:32:27Z","timestamp":1558780347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}