{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:55:44Z","timestamp":1780073744757,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662534250","type":"print"},{"value":"9783662534267","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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53426-7_29","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T04:49:15Z","timestamp":1472878155000},"page":"399-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Information Spreading in Dynamic Networks Under Oblivious Adversaries"],"prefix":"10.1007","author":[{"given":"John","family":"Augustine","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Avin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehraneh","family":"Liaee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P., Upfal, E.: Towards robust and efficient computation in dynamic peer-to-peer networks. In: SODA, pp. 551\u2013569 (2012)","DOI":"10.1137\/1.9781611973099.47"},{"key":"29_CR2","unstructured":"Augustine, J., Avin, C., Liaee, M., Pandurangan, G., Rajaraman, R.: Information spreading in dynamic networks under oblivious adversaries (2016). \n                    arXiv:1603.06109"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Augustine, J., Molla, A.R., Morsy, E., Pandurangan, G., Robinson, P., Upfal, E.: Storage and search in dynamic peer-to-peer networks. In: SPAA, pp. 53\u201362 (2013)","DOI":"10.1145\/2486159.2486170"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P.: Fast byzantine agreement in dynamic networks. In: PODC, pp. 74\u201383 (2013)","DOI":"10.1145\/2484239.2484275"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P., Roche, S., Upfal, E.: Enabling robust and efficient distributed computation in dynamic peer-to-peer networks. In: FOCS, pp. 350\u2013369 (2015)","DOI":"10.1109\/FOCS.2015.29"},{"key":"29_CR6","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. 5125, pp. 121\u2013132. Springer, Heidelberg (2008)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: PODC, pp. 260\u2013269 (2009)","DOI":"10.1145\/1582716.1582757"},{"issue":"1","key":"29_CR8","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. Distrib. Comput. 24(1), 31\u201344 (2011)","journal-title":"Distrib. Comput."},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5\u201334 (2004)","journal-title":"Combinatorica"},{"issue":"1\u20136","key":"29_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. Comput. Netw. 33(1\u20136), 309\u2013320 (2000)","journal-title":"Comput. Netw."},{"issue":"5","key":"29_CR11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jcss.2008.10.004","volume":"75","author":"AEF Clementi","year":"2009","unstructured":"Clementi, A.E.F., Monti, A., Pasquale, F., Silvestri, R.: Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4), 213\u2013230 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: PODC, pp. 213\u2013222 (2008)","DOI":"10.1145\/1400751.1400781"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1080\/15427951.2004.10129078","volume":"1","author":"C Cooper","year":"2003","unstructured":"Cooper, C., Frieze, A.: Crawling on simple models of web graphs. Internet Math. 1, 57\u201390 (2003)","journal-title":"Internet Math."},{"key":"29_CR15","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: SODA, pp. 717\u2013736 (2013)","DOI":"10.1137\/1.9781611973105.52"},{"issue":"5","key":"29_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A Ferreira","year":"2004","unstructured":"Ferreira, A.: Building a reference combinatorial model for manets. IEEE Netw. 18(5), 24\u201329 (2004)","journal-title":"IEEE Netw."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Ferreira, A., Goldman, A., Monteiro, J.: On the evaluation of shortest journeys in dynamic networks. In: NCA, pp. 3\u201310 (2007)","DOI":"10.1109\/NCA.2007.35"},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.01.004","volume":"52","author":"A Flaxman","year":"2004","unstructured":"Flaxman, A., Frieze, A.M., Upfal, E.: Efficient communication in an ad-hoc network. J. Algorithms 52(1), 1\u20137 (2004)","journal-title":"J. Algorithms"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Gilbert, S., Guerraoui, R., Kowalski, D.R.: On the complexity of asynchronous gossip. In: PODC, pp. 135\u2013144 (2008)","DOI":"10.1145\/1400751.1400771"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Gurevich, M., Keidar, I.: Correctness of gossip-based membership under message loss. In: PODC, pp. 151\u2013160 (2009)","DOI":"10.1145\/1582716.1582743"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Analyzing network coding gossip made easy. In: STOC, pp. 293\u2013302 (2011)","DOI":"10.1145\/1993636.1993676"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Karger, D.: Faster information dissemination in dynamic networks via network coding. In: PODC, pp. 381\u2013390 (2011)","DOI":"10.1145\/1993806.1993885"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-33651-5_12","volume-title":"Distributed Computing","author":"B Haeupler","year":"2012","unstructured":"Haeupler, B., Kuhn, F.: Lower bounds on information dissemination in dynamic networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 166\u2013180. Springer, Heidelberg (2012)"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Jarry, A., Lotker, Z.: Connectivity in evolving graph with geometric properties. In: DIALM-POMC, pp. 24\u201330 (2004)","DOI":"10.1145\/1022630.1022635"},{"issue":"4","key":"29_CR25","first-page":"820","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. JCSS 64(4), 820\u2013842 (2002)","journal-title":"JCSS"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: PODC, pp. 1\u201310 (2011)","DOI":"10.1145\/1993806.1993808"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes. Morgan-Kaufmann (1991)","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"issue":"33","key":"29_CR29","doi-asserted-by":"publisher","first-page":"11623","DOI":"10.1073\/pnas.0503018102","volume":"102","author":"D Liben-Nowell","year":"2005","unstructured":"Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. PNAS 102(33), 11623\u201311628 (2005)","journal-title":"PNAS"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC, pp. 104\u2013110 (2005)","DOI":"10.1145\/1080810.1080828"},{"key":"29_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-319-09620-9_3","volume-title":"Structural Information and Communication Complexity","author":"G Pandurangan","year":"2014","unstructured":"Pandurangan, G.: Distributed algorithmic foundations of dynamic networks. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 18\u201322. Springer, Heidelberg (2014)"},{"key":"29_CR32","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"29_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-33651-5_10","volume-title":"Distributed Computing","author":"A Das Sarma","year":"2012","unstructured":"Das Sarma, A., Molla, A.R., Pandurangan, G.: Fast distributed computation in dynamic networks via random walks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 136\u2013150. Springer, Heidelberg (2012)"},{"key":"29_CR34","doi-asserted-by":"crossref","unstructured":"Sarwate, A.D., Dimakis, A.G.: The impact of mobility on gossip algorithms. In: INFOCOM, pp. 2088\u20132096 (2009)","DOI":"10.1109\/INFCOM.2009.5062132"},{"key":"29_CR35","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/TSE.1985.231858","volume":"11","author":"DM Topkis","year":"1985","unstructured":"Topkis, D.M.: Concurrent broadcast for information dissemination. IEEE Trans. Soft. Eng. 11, 1107\u20131112 (1985)","journal-title":"IEEE Trans. Soft. Eng."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53426-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:11:47Z","timestamp":1558314707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53426-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534250","9783662534267"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53426-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Distributed Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wdag2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}