{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:05Z","timestamp":1763468225022},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096193"},{"type":"electronic","value":"9783319096209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09620-9_3","type":"book-chapter","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T22:07:37Z","timestamp":1405462057000},"page":"18-22","source":"Crossref","is-referenced-by-count":4,"title":["Distributed Algorithmic Foundations of Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Gopal","family":"Pandurangan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-03850-6_2","volume-title":"Principles of Distributed Systems","author":"S. Abshoff","year":"2013","unstructured":"Abshoff, S., Benter, M., Malatyali, M., Meyer auf der Heide, F.: On two-party communication through dynamic networks. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol.\u00a08304, pp. 11\u201322. Springer, Heidelberg (2013)"},{"key":"3_CR2","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":"3_CR3","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P.: Fast byzantine agreement in dynamic networks. In: Fatourou, P., Taubenfeld, G. (eds.) PODC, pp. 74\u201383. ACM (2013)","DOI":"10.1145\/2484239.2484275"},{"key":"3_CR4","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: ACM-SIAM, SODA 2012, pp. 551\u2013569. SIAM (2012)","DOI":"10.1137\/1.9781611973099.47"},{"key":"3_CR5","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":"3_CR6","doi-asserted-by":"crossref","unstructured":"Cornejo, A., Gilbert, S., Newport, C.C.: Aggregation in dynamic networks. In: PODC, pp. 195\u2013204 (2012)","DOI":"10.1145\/2332432.2332468"},{"key":"3_CR7","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: Khanna, S. (ed.) SODA, pp. 717\u2013736. SIAM (2013)","DOI":"10.1137\/1.9781611973105.52"},{"issue":"5","key":"3_CR8","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. SIAM J. Comput.\u00a017(5), 975\u2013988 (1988)","journal-title":"SIAM J. Comput."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Falkner, J., Piatek, M., John, J.P., Krishnamurthy, A., Anderson, T.E.: Profiling a million user dht. In: Internet Measurement Comference, pp. 129\u2013134 (2007)","DOI":"10.1145\/1298306.1298325"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/510726.510756","volume":"32","author":"P. Krishna Gummadi","year":"2002","unstructured":"Krishna Gummadi, P., Saroiu, S., Gribble, S.D.: A measurement study of napster and gnutella as examples of peer-to-peer file sharing systems. Computer Communication Review\u00a032(1), 82 (2002)","journal-title":"Computer Communication Review"},{"issue":"1","key":"3_CR11","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":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: ACM STOC, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011, pp. 1\u201310. ACM (2011)","DOI":"10.1145\/1993806.1993808"},{"key":"3_CR14","unstructured":"Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Survey and Tutorial (2004)"},{"key":"3_CR15","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"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"3_CR17","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.\u00a07611, pp. 136\u2013150. Springer, Heidelberg (2012)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/637201.637222","volume-title":"Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurment, IMW 2002","author":"S. Sen","year":"2002","unstructured":"Sen, S., Wang, J.: Analyzing peer-to-peer traffic across large networks. In: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurment, IMW 2002, pp. 137\u2013150. ACM, New York (2002)"}],"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-09620-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:12:53Z","timestamp":1558937573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09620-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096193","9783319096209"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09620-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}