{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:45Z","timestamp":1760202705673,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_42","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"528-539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms"],"prefix":"10.1007","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"F\u00fcgger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Nowak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11776178_3","volume-title":"Distributed Computing in Sensor Systems","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 37\u201350. Springer, Heidelberg (2006)"},{"issue":"4","key":"42_CR2","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1145\/179812.179902","volume":"41","author":"H Attiya","year":"1994","unstructured":"Attiya, H., Lynch, N.A., Shavit, N.: Are wait-free algorithms fast? J. ACM 41(4), 725\u2013763 (1994)","journal-title":"J. ACM"},{"key":"42_CR3","volume-title":"Distributed Computing","author":"H Attiya","year":"2005","unstructured":"Attiya, H., Welch, J.: Distributed Computing. Wiley, Hoboken (2005)"},{"key":"42_CR4","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Belmont (1989)"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-31104-8_7","volume-title":"Structural Information and Communication Complexity","author":"M Biely","year":"2012","unstructured":"Biely, M., Robinson, P., Schmid, U.: Agreement in directed dynamic networks. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 73\u201384. Springer, Heidelberg (2012)"},{"issue":"5","key":"42_CR6","doi-asserted-by":"publisher","first-page":"2707","DOI":"10.1137\/12086594X","volume":"52","author":"V Blondel","year":"2014","unstructured":"Blondel, V., Olshevshy, A.: How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard. SIAM J. Control Optim. 52(5), 2707\u20132726 (2014)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"42_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/060657005","volume":"47","author":"M Cao","year":"2008","unstructured":"Cao, M., Morse, A.S., Anderson, B.D.O.: Reaching a consensus in a dynamically changing environment: a graphical approach. SIAM J. Control Optim. 47(2), 575\u2013600 (2008)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"42_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/060657029","volume":"47","author":"M Cao","year":"2008","unstructured":"Cao, M., Morse, A.S., Anderson, B.D.O.: Reaching a consensus in a dynamically changing environment: convergence rates, measurement delays, and asynchronous events. SIAM J. Control Optim. 47(2), 601\u2013623 (2008)","journal-title":"SIAM J. Control Optim."},{"unstructured":"Charron-Bost, B.: Orientation and connectivity based criteria for asymptotic consensus (2013). arXiv:1303.2043v1 [cs.DC]","key":"42_CR9"},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The Heard-Of model: computing in distributed systems with benign faults. Distrib. Comput. 22(1), 49\u201371 (2009)","journal-title":"Distrib. Comput."},{"key":"42_CR11","volume-title":"Spectral Graph Theory","author":"FR Chung","year":"1997","unstructured":"Chung, F.R.: Spectral Graph Theory. AMS, Providence (1997)"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-03578-9_3","volume-title":"Structural Information and Communication Complexity","author":"\u00c9 Coulouma","year":"2013","unstructured":"Coulouma, \u00c9., Godard, E.: A characterization of dynamic networks where consensus is solvable. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 24\u201335. Springer, Heidelberg (2013)"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0024-3795(92)90012-Y","volume":"161","author":"I Daubechies","year":"1992","unstructured":"Daubechies, I., Lagarias, J.C.: Sets of matrices all infinite products of which converge. Linear Algebra Appl. 161, 227\u2013263 (1992)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"42_CR14","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(2), 499\u2013516 (1986)","journal-title":"J. ACM"},{"issue":"1","key":"42_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01783662","volume":"4","author":"AD Fekete","year":"1990","unstructured":"Fekete, A.D.: Asymptotically optimal algorithms for approximate agreement. Distrib. Comput. 4(1), 9\u201329 (1990)","journal-title":"Distrib. Comput."},{"issue":"2","key":"42_CR16","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: 42nd ACM Symposium on Theory of Computing, pp. 513\u2013522. ACM, New York City (2010)","key":"42_CR17","DOI":"10.1145\/1806689.1806760"},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In: 30th Annual ACM Symposium on Principles of Distributed Computing, pp. 1\u201310. ACM, New York City (2011)","key":"42_CR18","DOI":"10.1145\/1993806.1993808"},{"key":"42_CR19","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"doi-asserted-by":"crossref","unstructured":"Olshevsky, A., Tsitsiklis, J.N.: Degree fluctuations and the convergence time of consensus algorithms (2011), arXiv:1104.0454v1 [math.OC]","key":"42_CR20","DOI":"10.1109\/CDC.2011.6160945"},{"key":"42_CR21","first-page":"304","volume-title":"6th Symposium on Theoretical Aspects of Computer Science, LNCS","author":"N Santoro","year":"1989","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Monien, B., Cori, R. (eds.) 6th Symposium on Theoretical Aspects of Computer Science, LNCS, vol. 349, pp. 304\u2013313. Springer, Heidelberg (1989)"},{"unstructured":"Tsitsiklis, J.N.: Problems in Decentralized Decision Making and Computation. Ph.D. thesis, Massachusetts Institute of Technology (1984)","key":"42_CR22"},{"unstructured":"Xia, W., Cao, M.: Sarymsakov matrices and their application in coordinating multi-agent systems. In: 31st Chinese Control Conference, pp. 6321\u20136326. IEEE, New York City (2012)","key":"42_CR23"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:42:20Z","timestamp":1676018540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}