{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:39:29Z","timestamp":1763620769097,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,31]]},"DOI":"10.1145\/3382734.3405724","type":"proceedings-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:33:55Z","timestamp":1596234835000},"page":"149-158","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Asynchronous Byzantine Approximate Consensus in Directed Networks"],"prefix":"10.1145","author":[{"given":"Dimitris","family":"Sakavalas","sequence":"first","affiliation":[{"name":"Boston College"}]},{"given":"Lewis","family":"Tseng","sequence":"additional","affiliation":[{"name":"Boston College"}]},{"given":"Nitin H.","family":"Vaidya","sequence":"additional","affiliation":[{"name":"Georgetown University"}]}],"member":"320","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"229","volume-title":"OPODIS","author":"Abraham I.","year":"2004","unstructured":"I. Abraham , Y. Amit , and D. Dolev . Optimal resilience asynchronous approximate agreement . In OPODIS , pages 229 -- 239 , 2004 . I. Abraham, Y. Amit, and D. Dolev. Optimal resilience asynchronous approximate agreement. In OPODIS, pages 229--239, 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2016.68"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138036"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323602"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_8_1","first-page":"1","volume-title":"31st International Symposium on Distributed Computing, DISC 2017","volume":"91","author":"F\u00fcgger M.","year":"2017","unstructured":"M. F\u00fcgger , T. Nowak , and M. Schwarz . Brief announcement: Lower bounds for asymptotic consensus in dynamic networks . In 31st International Symposium on Distributed Computing, DISC 2017 , October 16-20, 2017 , Vienna, Austria , volume 91 of LIPIcs, pages 51: 1 -- 51 :3. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2017. M. F\u00fcgger, T. Nowak, and M. Schwarz. Brief announcement: Lower bounds for asymptotic consensus in dynamic networks. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, volume 91 of LIPIcs, pages 51:1--51:3. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2017."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.262588"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130413"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39247-4_23"},{"key":"e_1_3_2_1_12_1","volume-title":"Distributed Algorithms. Morgan Kaufmann","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch . Distributed Algorithms. Morgan Kaufmann , 1996 . N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0279-6"},{"key":"e_1_3_2_1_14_1","volume-title":"FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings","volume":"10472","author":"Pagourtzis A.","year":"2017","unstructured":"A. Pagourtzis , G. Panagiotakos , and D. Sakavalas . Reliable communication via semilattice properties of partial knowledge. In Fundamentals of Computation Theory - 21st International Symposium , FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings , volume 10472 of Lecture Notes in Computer Science, pages 367--380. Springer , 2017 . A. Pagourtzis, G. Panagiotakos, and D. Sakavalas. Reliable communication via semilattice properties of partial knowledge. In Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings, volume 10472 of Lecture Notes in Computer Science, pages 367--380. Springer, 2017."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_16_1","first-page":"1","volume-title":"22nd International Conference on Principles of Distributed Systems, OPODIS 2018","volume":"125","author":"Sakavalas D.","year":"2018","unstructured":"D. Sakavalas , L. Tseng , and N. H. Vaidya . Effects of topology knowledge and relay depth on asynchronous appoximate consensus . In 22nd International Conference on Principles of Distributed Systems, OPODIS 2018 , December 17-19, 2018 , Hong Kong, China , volume 125 of LIPIcs, pages 14: 1 -- 14 :16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. D. Sakavalas, L. Tseng, and N. H. Vaidya. Effects of topology knowledge and relay depth on asynchronous appoximate consensus. In 22nd International Conference on Principles of Distributed Systems, OPODIS 2018, December 17-19, 2018, Hong Kong, China, volume 125 of LIPIcs, pages 14:1--14:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018."},{"key":"e_1_3_2_1_17_1","volume-title":"Asynchronous byzantine approximate consensus in directed networks. CoRR, abs\/2004.09054","author":"Sakavalas D.","year":"2020","unstructured":"D. Sakavalas , L. Tseng , and N. H. Vaidya . Asynchronous byzantine approximate consensus in directed networks. CoRR, abs\/2004.09054 , 2020 . D. Sakavalas, L. Tseng, and N. H. Vaidya. Asynchronous byzantine approximate consensus in directed networks. CoRR, abs\/2004.09054, 2020."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.12.003"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA568111"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767399"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332505"}],"event":{"name":"PODC '20: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '20"},"container-title":["Proceedings of the 39th Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3405724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:50Z","timestamp":1750197770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":21,"alternative-id":["10.1145\/3382734.3405724","10.1145\/3382734"],"URL":"https:\/\/doi.org\/10.1145\/3382734.3405724","relation":{},"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"2020-07-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}