{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:32Z","timestamp":1763468192870},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_42","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"495-507","source":"Crossref","is-referenced-by-count":8,"title":["Randomized Rumor Spreading in Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"George","family":"Giakkoupis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Stauffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70575-8_11","volume-title":"Automata, Languages and Programming","author":"C. Avin","year":"2008","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to explore a fast-changing world (Cover time of a simple random walk on evolving graphs). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 121\u2013132. Springer, Heidelberg (2008)"},{"issue":"1","key":"42_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00446-011-0133-9","volume":"24","author":"H. Baumann","year":"2011","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. Distributed Computing\u00a024(1), 31\u201344 (2011)","journal-title":"Distributed Computing"},{"issue":"6","key":"42_CR3","doi-asserted-by":"publisher","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.\u00a041(6), 1451\u20131465 (2012)","journal-title":"SIAM J. Comput."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proc. 42nd STOC, pp. 399\u2013408 (2010)","DOI":"10.1145\/1806689.1806745"},{"issue":"24","key":"42_CR5","doi-asserted-by":"publisher","first-page":"2602","DOI":"10.1016\/j.tcs.2010.11.001","volume":"412","author":"F. Chierichetti","year":"2011","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumor spreading in social networks. Theor. Comput. Sci.\u00a0412(24), 2602\u20132610 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-40450-4_28","volume-title":"Algorithms \u2013 ESA 2013","author":"A. Clementi","year":"2013","unstructured":"Clementi, A., Crescenzi, P., Doerr, C., Fraigniaud, P., Isopi, M., Panconesi, A., Pasquale, F., Silvestri, R.: Rumor spreading in random evolving graphs. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 325\u2013336. Springer, Heidelberg (2013)"},{"issue":"9","key":"42_CR7","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TPDS.2011.33","volume":"22","author":"A.E.F. Clementi","year":"2011","unstructured":"Clementi, A.E.F., Monti, A., Pasquale, F., Silvestri, R.: Information spreading in stationary markovian evolving graphs. IEEE Trans. Parallel Distrib. Syst.\u00a022(9), 1425\u20131432 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Silvestri, R., Trevisan, L.: Information spreading in dynamic graphs. In: Proc. 31st PODC, pp. 37\u201346 (2012)","DOI":"10.1145\/2332432.2332439"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: Proc. 43rd STOC, pp. 21\u201330 (2011)","DOI":"10.1145\/1993636.1993640"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: Proc. 24th SODA, pp. 717\u2013736 (2013)","DOI":"10.1137\/1.9781611973105.52"},{"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 Struct. Algorithms\u00a01(4), 447\u2013460 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks. In: Proc. 23rd SODA, pp. 1642\u20131660 (2012)","DOI":"10.1137\/1.9781611973099.130"},{"issue":"2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2450142.2450147","volume":"60","author":"C. Georgiou","year":"2013","unstructured":"Georgiou, C., Gilbert, S., Guerraoui, R., Kowalski, D.R.: Asynchronous gossip. J. ACM\u00a060(2), 11 (2013)","journal-title":"J. ACM"},{"key":"42_CR14","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proc. 28th STACS, pp. 57\u201368 (2011)"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading with vertex expansion. In: Proc. 25th SODA, pp. 801\u2013815 (2014)","DOI":"10.1137\/1.9781611973402.59"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: Proc. 23rd SODA, pp. 1623\u20131641 (2012)","DOI":"10.1137\/1.9781611973099.129"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Karger, D.R.: Faster information dissemination in dynamic networks via network coding. In: Proc. 30th PODC, pp. 381\u2013390 (2011)","DOI":"10.1145\/1993806.1993885"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Kuhn, F.: Lower bounds on information dissemination in dynamic networks. In: Proc. 26th DISC, pp. 166\u2013180 (2012)","DOI":"10.1007\/978-3-642-33651-5_12"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proc. 41st FOCS, pp. 565\u2013557 (2000)","DOI":"10.1109\/SFCS.2000.892324"},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1214\/009117905000000413","volume":"33","author":"H. Kesten","year":"2005","unstructured":"Kesten, H., Sidoravicius, V.: The spread of a rumor or infection in a moving population. Annals of Probability\u00a033, 2402\u20132462 (2005)","journal-title":"Annals of Probability"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proc. 42nd STOC, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Lam, H., Liu, Z., Mitzenmacher, M., Sun, X., Wang, Y.: Information dissemination via random walks in d-dimensional space. In: Proc. 23rd SODA, pp. 1612\u20131622 (2012)","DOI":"10.1137\/1.9781611973099.128"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proc. 17th WWW, pp. 695\u2013704 (2008)","DOI":"10.1145\/1367497.1367591"},{"issue":"7","key":"42_CR24","first-page":"2997","volume":"54","author":"D. Mosk-Aoyama","year":"2008","unstructured":"Mosk-Aoyama, D., Shah, D.: Fast distributed algorithms for computing separable functions. IEEEToIT\u00a054(7), 2997\u20133007 (2008)","journal-title":"IEEEToIT"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Peres, Y., Sinclair, A., Sousi, P., Stauffer, A.: Mobile geometric graphs: Detection, coverage and percolation. In: Proc. 22nd SODA, pp. 412\u2013428 (2011)","DOI":"10.1137\/1.9781611973082.33"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Pettarin, A., Pietracaprina, A., Pucci, G., Upfal, E.: Tight bounds on information dissemination in sparse mobile networks. In: Proc. 30th PODC, pp. 355\u2013362 (2011)","DOI":"10.1145\/1993806.1993882"},{"issue":"1","key":"42_CR27","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. Applied Math.\u00a047(1), 213\u2013223 (1987)","journal-title":"SIAM J. Applied Math."},{"key":"42_CR28","doi-asserted-by":"crossref","unstructured":"Sarma, A.D., Molla, A.R., Pandurangan, G.: Fast distributed computation in dynamic networks via random walks. In: Proc. 26th DISC, pp. 136\u2013150 (2012)","DOI":"10.1007\/978-3-642-33651-5_10"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"Sauerwald, T., Stauffer, A.: Rumor spreading and vertex expansion on regular graphs. In: Proc. 22nd SODA, pp. 462\u2013475 (2011)","DOI":"10.1137\/1.9781611973082.37"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T12:21:08Z","timestamp":1565526068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}