{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:04Z","timestamp":1759637944762,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"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.3404503","type":"proceedings-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:33:55Z","timestamp":1596234835000},"page":"169-171","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time"],"prefix":"10.1145","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[{"name":"International Institute of Information Technology Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"I. Abraham D. Dolev and J. Y. Halpern. 2008. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM 405--414.  I. Abraham D. Dolev and J. Y. Halpern. 2008. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM 405--414.","DOI":"10.1145\/1400751.1400804"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3388788"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1 M. Hirt and J. B. Nielsen. 2010. On the Theoretical Gap Between Synchronous and Asynchronous MPC Protocols. In PODC. ACM 211--218.  Z. Beerliov\u00e1-Trub\u00edniov\u00e1 M. Hirt and J. B. Nielsen. 2010. On the Theoretical Gap Between Synchronous and Asynchronous MPC Protocols. In PODC. ACM 211--218.","DOI":"10.1145\/1835698.1835746"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or. 1983. Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In PODC. ACM 27--30.  M. Ben-Or. 1983. Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In PODC. ACM 27--30.","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"G. Bracha. 1984. An Asynchronous [(n-1)\/3]-Resilient Consensus Protocol. In PODC. ACM 154--162.  G. Bracha. 1984. An Asynchronous [(n-1)\/3]-Resilient Consensus Protocol. In PODC. ACM 154--162.","DOI":"10.1145\/800222.806743"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"R. Canetti and T. Rabin. 1993. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In STOC. ACM 42--51.  R. Canetti and T. Rabin. 1993. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In STOC. ACM 42--51.","DOI":"10.1145\/167088.167105"},{"volume":"8205","volume-title":"Asynchronous Multiparty Computation with Linear Communication Complexity. In DISC (Lecture Notes in Computer Science)","author":"Choudhury A.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Paul Feldman and Silvio Micali. 1988. Optimal Algorithms for Byzantine Agreement. In STOC. ACM 148--161.  Paul Feldman and Silvio Micali. 1988. Optimal Algorithms for Byzantine Agreement. In STOC. ACM 148--161.","DOI":"10.1145\/62212.62225"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0200-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2827360"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"volume-title":"Randomized Byzantine Generals","author":"Rabin Michael O.","key":"e_1_3_2_1_13_1"},{"volume-title":"Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity. CoRR abs\/1507.06165","year":"2015","author":"Wang C.","key":"e_1_3_2_1_14_1"}],"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.3404503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3404503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:49Z","timestamp":1750197769000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3404503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":14,"alternative-id":["10.1145\/3382734.3404503","10.1145\/3382734"],"URL":"https:\/\/doi.org\/10.1145\/3382734.3404503","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"}}]}}