{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:27:58Z","timestamp":1726849678569},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004271","name":"Sapienza University of Rome","doi-asserted-by":"publisher","award":["RM11715C816CE4CB"],"id":[{"id":"10.13039\/501100004271","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006601","name":"MAECI","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1016\/j.tcs.2018.08.001","type":"journal-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T16:35:24Z","timestamp":1534782924000},"page":"17-29","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"special_numbering":"C","title":["Approximate Agreement under Mobile Byzantine Faults"],"prefix":"10.1016","volume":"758","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-9928-5357","authenticated-orcid":false,"given":"Silvia","family":"Bonomi","sequence":"first","affiliation":[]},{"given":"Antonella","family":"Del Pozzo","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0948-7172","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"22","key":"10.1016\/j.tcs.2018.08.001_br0010","first-page":"1","article-title":"An improved Byzantine agreement algorithm for synchronous systems with mobile faults","volume":"43","author":"Banu","year":"2012","journal-title":"Int. J. Comput. Appl."},{"key":"10.1016\/j.tcs.2018.08.001_br0020","series-title":"30th Annual Symposium on Foundations of Computer Science","first-page":"410","article-title":"Towards optimal distributed consensus (extended abstract)","author":"Berman","year":"1989"},{"key":"10.1016\/j.tcs.2018.08.001_br0030","series-title":"Distributed Computing \u2013 28th International Symposium","first-page":"76","article-title":"Tight bound on mobile Byzantine agreement","author":"Bonnet","year":"2014"},{"key":"10.1016\/j.tcs.2018.08.001_br0040","series-title":"Principles of Distributed Systems, 13th International Conference","first-page":"54","article-title":"Byzantine convergence in robot networks: the price of asynchrony","volume":"vol. 5923","author":"Bouzid","year":"2009"},{"issue":"34\u201336","key":"10.1016\/j.tcs.2018.08.001_br0050","doi-asserted-by":"crossref","first-page":"3154","DOI":"10.1016\/j.tcs.2010.05.006","article-title":"Optimal Byzantine-resilient convergence in uni-dimensional robot networks","volume":"411","author":"Bouzid","year":"2010","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2018.08.001_br0060","series-title":"Proceedings of the 25th International Symposium on Fault-Tolerant Computing","first-page":"83","article-title":"Optimal resiliency against mobile faults","author":"Buhrman","year":"1995"},{"key":"10.1016\/j.tcs.2018.08.001_br0070","series-title":"Automata, Languages, and Programming \u2013 42nd International Colloquium","first-page":"528","article-title":"Approximate consensus in highly dynamic networks: the role of averaging algorithms","author":"Charron-Bost","year":"2015"},{"issue":"3","key":"10.1016\/j.tcs.2018.08.001_br0080","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/5925.5931","article-title":"Reaching approximate agreement in the presence of faults","volume":"33","author":"Dolev","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2018.08.001_br0090","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01783662","article-title":"Asymptotically optimal algorithms for approximate agreement","volume":"4","author":"Fekete","year":"1990","journal-title":"Distrib. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2018.08.001_br0100","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1006\/inco.1994.1094","article-title":"Asynchronous approximate agreement","volume":"115","author":"Fekete","year":"1994","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/j.tcs.2018.08.001_br0110","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01843568","article-title":"Easy impossibility proofs for distributed consensus problems","volume":"1","author":"Fischer","year":"1986","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2018.08.001_br0120","series-title":"Proceedings of the 8th International Workshop on Distributed Algorithms","first-page":"253","article-title":"Reaching (and maintaining) agreement in the presence of mobile faults","volume":"vol. 857","author":"Garay","year":"1994"},{"issue":"1","key":"10.1016\/j.tcs.2018.08.001_br0130","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/71.262588","article-title":"Reaching approximate agreement with mixed-mode faults","volume":"5","author":"Kieckhafer","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10.1016\/j.tcs.2018.08.001_br0140","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"9","key":"10.1016\/j.tcs.2018.08.001_br0150","doi-asserted-by":"crossref","first-page":"2860","DOI":"10.1016\/j.jpdc.2014.05.005","article-title":"Approximate Byzantine consensus in sparse, mobile ad-hoc networks","volume":"74","author":"Li","year":"2014","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.tcs.2018.08.001_br0160","series-title":"Distributed Algorithms","author":"Lynch","year":"1996"},{"key":"10.1016\/j.tcs.2018.08.001_br0170","series-title":"Symposium on Theory of Computing Conference","first-page":"391","article-title":"Multidimensional approximate agreement in Byzantine asynchronous systems","author":"Mendes","year":"2013"},{"issue":"6","key":"10.1016\/j.tcs.2018.08.001_br0180","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s00446-014-0240-5","article-title":"Multidimensional agreement in Byzantine systems","volume":"28","author":"Mendes","year":"2015","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2018.08.001_br0190","series-title":"Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing","first-page":"51","article-title":"How to withstand mobile virus attacks (extended abstract)","author":"Ostrovsky","year":"1991"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2018.08.001_br0200","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0019-9958(85)80042-5","article-title":"A new solution for the Byzantine generals problem","volume":"64","author":"Reischuk","year":"1985","journal-title":"Inf. Control"},{"key":"10.1016\/j.tcs.2018.08.001_br0210","series-title":"Proceedings of the 17th International Conference on Principles of Distributed Systems","first-page":"236","article-title":"Mobile Byzantine agreement on arbitrary network","author":"Sasaki","year":"2013"},{"key":"10.1016\/j.tcs.2018.08.001_br0290","series-title":"19th International Conference on Principles of Distributed Systems (OPODIS 2015)","first-page":"1","article-title":"Byzantine approximate agreement with median validity","volume":"vol. 46","author":"Stolz","year":"2016"},{"key":"10.1016\/j.tcs.2018.08.001_br0230","series-title":"Stabilization, Safety, and Security of Distributed Systems \u2013 17th International Symposium","first-page":"21","article-title":"Reaching approximate Byzantine consensus with multi-hop communication","author":"Su","year":"2015"},{"key":"10.1016\/j.tcs.2018.08.001_br0240","series-title":"Distributed Computing and Networking, 14th International Conference","first-page":"72","article-title":"Iterative approximate Byzantine consensus under a generalized fault model","author":"Tseng","year":"2013"},{"key":"10.1016\/j.tcs.2018.08.001_br0250","series-title":"ACM Symposium on Principles of Distributed Computing","first-page":"396","article-title":"Asynchronous convex hull consensus in the presence of crash faults","author":"Tseng","year":"2014"},{"key":"10.1016\/j.tcs.2018.08.001_br0260","series-title":"Networked Systems \u2013 Second International Conference","first-page":"84","article-title":"Iterative approximate consensus in the presence of Byzantine link failures","author":"Tseng","year":"2014"},{"key":"10.1016\/j.tcs.2018.08.001_br0270","series-title":"ACM Symposium on Principles of Distributed Computing","first-page":"365","article-title":"Iterative approximate Byzantine consensus in arbitrary directed graphs","author":"Vaidya","year":"2012"},{"key":"10.1016\/j.tcs.2018.08.001_br0280","series-title":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing","first-page":"171","article-title":"The mobile adversary paradigm in distributed computation and systems","author":"Yung","year":"2015"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518305176?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518305176?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T16:30:37Z","timestamp":1712421037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397518305176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":28,"alternative-id":["S0304397518305176"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2018.08.001","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2019,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximate Agreement under Mobile Byzantine Faults","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2018.08.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}