{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:47:37Z","timestamp":1764557257737},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336508"},{"type":"electronic","value":"9783642336515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33651-5_12","type":"book-chapter","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T09:25:32Z","timestamp":1352798732000},"page":"166-180","source":"Crossref","is-referenced-by-count":21,"title":["Lower Bounds on Information Dissemination in Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-15763-9_34","volume-title":"Distributed Computing","author":"A.F. Anta","year":"2010","unstructured":"Anta, A.F., Milani, A., Mosteiro, M.A., Zaks, S.: Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 374\u2013388. Springer, Heidelberg (2010)"},{"key":"12_CR2","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)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proc. 28th ACM Symp. on Principles of Distributed Computing (PODC), pp. 260\u2013269 (2009)","DOI":"10.1145\/1582716.1582757"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Clementi, A., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: Proc. of 27th ACM Symp. on Principles of Distributed Computing (PODC), pp. 213\u2013222 (2008)","DOI":"10.1145\/1400751.1400781"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jcss.2008.10.004","volume":"75","author":"A. Clementi","year":"2009","unstructured":"Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Broadcasting in dynamic radio networks. Journal of Computer and System Sciences\u00a075(4), 213\u2013230 (2009)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Clementi, A., Pasquale, F., Monti, A., Silvestri, R.: Information spreading in stationary markovian evolving graphs. In: Proc. of IEEE Symp. on Parallel & Distributed Processing, IPDPS (2009)","DOI":"10.1109\/IPDPS.2009.5160986"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Clementi, A., Silvestri, R., Trevisan, L.: Information spreading in dynamic graphs. In: Proc. 31st Symp. on Principles of Distributed Computing, PODC (2012)","DOI":"10.1145\/2332432.2332439"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Cornejo, A., Gilbert, S., Newport, C.: Aggregation in dynamic networks. In: Proc. 31st Symp. on Principles of Distributed Computing, PODC (2012)","DOI":"10.1145\/2332432.2332468"},{"key":"12_CR9","unstructured":"Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z.: Information spreading in dynamic networks. CoRR, abs\/1112.0384 (2011)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Analyzing network coding gossip made easy. In: Proc. 43nd Symp. on Theory of Computing (STOC), pp. 293\u2013302 (2011)","DOI":"10.1145\/1993636.1993676"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Karger, D.: Faster information dissemination in dynamic networks via network coding. In: Proc. 30th Symp. on Principles of Distributed Computing (PODC), pp. 381\u2013390 (2011)","DOI":"10.1145\/1993806.1993885"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Haeupler, B., M\u00e9dard, M.: One packet suffices - highly efficient packetized network coding with finite memory. In: 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1151\u20131155 (2011)","DOI":"10.1109\/ISIT.2011.6033713"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jctb.2004.01.004","volume":"94","author":"B. Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Independence free graphs and vertex connectivity augmentation. Journal of Combinatorial Theory, Series B\u00a094(1), 31\u201377 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lenzen, C., Locher, T., Oshman, R.: Optimal gradient clock synchronization in dynamic networks. In: Proc. of 29th ACM Symp. on Principles of Distributed Computing (PODC), pp. 430\u2013439 (2010)","DOI":"10.1145\/1835698.1835799"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Newport, C., Oshman, R., Richa, A.: Broadcasting in unreliable radio networks. In: Proc. of 29th ACM Symp. on Principles of Distributed Computing (PODC), pp. 336\u2013345 (2010)","DOI":"10.1145\/1835698.1835779"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proc. 42nd Symp. on Theory of Computing (STOC), pp. 557\u2013570 (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In: Proc. 30th Symp. on Principles of Distributed Computing (PODC), pp. 1\u201310 (2011)","DOI":"10.1145\/1993806.1993808"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F. Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: Models and algorithms. SIGACT News\u00a042(1), 82\u201396 (2011)","journal-title":"SIGACT News"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proc. of Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 104\u2013110 (2005)","DOI":"10.1145\/1080810.1080828"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33651-5_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:17:26Z","timestamp":1620130646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33651-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336508","9783642336515"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33651-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}