{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:13:56Z","timestamp":1761293636285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_8","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T23:30:06Z","timestamp":1507246206000},"page":"109-125","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Approximate Consensus Algorithm in the Presence of Mobile Faults"],"prefix":"10.1007","author":[{"given":"Lewis","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11516798_17","volume-title":"Principles of Distributed Systems","author":"I Abraham","year":"2005","unstructured":"Abraham, I., Amit, Y., Dolev, D.: Optimal resilience asynchronous approximate agreement. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 229\u2013239. Springer, Heidelberg (2005). doi: 10.1007\/11516798_17"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley Series on Parallel and Distributed Computing (2004)","DOI":"10.1002\/0471478210"},{"key":"8_CR3","unstructured":"Banu, N., Souissi, S., Izumi, T., Bessani, A.N., Correia, M., Neves, N.F., Buhrman, H., Garay, J.A.: An improved Byzantine agreement algorithm for synchronous systems with mobile faults (2012)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-662-45174-8_6","volume-title":"Distributed Computing","author":"F Bonnet","year":"2014","unstructured":"Bonnet, F., D\u00e9fago, X., Nguyen, T.D., Potop-Butucaru, M.: Tight bound on mobile Byzantine agreement. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 76\u201390. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45174-8_6"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Approximate agreement under mobile Byzantine faults. CoRR, abs\/1604.03871 (2016)","DOI":"10.1109\/ICDCS.2016.68"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Approximate agreement under mobile Byzantine faults. In: 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), pp. 727\u2013728, June 2016","DOI":"10.1109\/ICDCS.2016.68"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Garay, J.A., Hoepman, J.H.: Optimal resiliency against mobile faults. In: Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers, pp. 83\u201388, June 1995","DOI":"10.1109\/FTCS.1995.466995"},{"key":"8_CR8","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, 499\u2013516 (1986)","journal-title":"J. ACM"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0020438","volume-title":"Distributed Algorithms","author":"JA Garay","year":"1994","unstructured":"Garay, J.A.: Reaching (and maintaining) agreement in the presence of mobile faults. In: Tel, G., Vit\u00e1nyi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 253\u2013264. Springer, Heidelberg (1994). doi: 10.1007\/BFb0020438"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Haseltalab, A., Akar, M.: Approximate Byzantine consensus in faulty asynchronous networks. In: 2015 American Control Conference (ACC), July 2015","DOI":"10.1109\/ACC.2015.7170960"},{"issue":"6","key":"8_CR11","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1109\/TAC.2003.812781","volume":"48","author":"A Jadbabaie","year":"2003","unstructured":"Jadbabaie, A., Lin, J., Morse, A.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(6), 988\u20131001 (2003)","journal-title":"IEEE Trans. Autom. Control"},{"key":"8_CR12","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information, pp. 482\u2013491. IEEE Computer Society (2003)"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/71.262588","volume":"5","author":"RM Kieckhafer","year":"1994","unstructured":"Kieckhafer, R.M., Azadmanesh, M.H.: Reaching approximate agreement with mixed-mode faults. IEEE Trans. Parallel Distrib. Syst. 5(1), 53\u201363 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"8_CR15","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1991. ACM (1991)","DOI":"10.1145\/112600.112605"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-03850-6_17","volume-title":"Principles of Distributed Systems","author":"T Sasaki","year":"2013","unstructured":"Sasaki, T., Yamauchi, Y., Kijima, S., Yamashita, M.: Mobile Byzantine agreement on arbitrary network. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol. 8304, pp. 236\u2013250. Springer, Cham (2013). doi: 10.1007\/978-3-319-03850-6_17"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/TSP.2007.906734","volume":"56","author":"I Schizas","year":"2008","unstructured":"Schizas, I., Ribeiro, A., Giannakis, G.: Consensus in ad hoc WSNs with noisy links - Part I: distributed estimation of deterministic signals. IEEE Trans. Sig. Process. 56(1), 350\u2013364 (2008)","journal-title":"IEEE Trans. Sig. Process."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-09581-3_7","volume-title":"Networked Systems","author":"L Tseng","year":"2014","unstructured":"Tseng, L., Vaidya, N.: Iterative approximate consensus in the presence of Byzantine link failures. In: Noubir, G., Raynal, M. (eds.) NETYS 2014. LNCS, vol. 8593, pp. 84\u201398. Springer, Cham (2014). doi: 10.1007\/978-3-319-09581-3_7"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate Byzantine consensus in arbitrary directed graphs. In: PODC 2012 (2012)","DOI":"10.1145\/2332432.2332505"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Yung, M.: The mobile adversary paradigm in distributed computation and systems. In: PODC 2015 (2015)","DOI":"10.1145\/2767386.2767453"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:16:55Z","timestamp":1570166215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}