{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:46Z","timestamp":1750306966375,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T00:00:00Z","timestamp":1374451200000},"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":[[2013,7,22]]},"DOI":"10.1145\/2484239.2484288","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"187-189","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[{"name":"University of Victoria, Victoria, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0081-5"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411510"},{"key":"e_1_3_2_1_3_1","first-page":"14","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"Attiya H.","unstructured":"H. Attiya and J. Welch . Distributed Computing: Fundamentals, Simulations and Advanced Topics ( 2 nd edition), page 14 . John Wiley Interscience, March 2004. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition), page 14. John Wiley Interscience, March 2004.","edition":"2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132543"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_8_1","first-page":"443","article-title":"Randomization in Byzantine agreement","volume":"5","author":"Chor B.","year":"1989","unstructured":"B. Chor and C. Dwork . Randomization in Byzantine agreement . Advances in Computing Research , 5 : 443 -- 498 , 1989 . B. Chor and C. Dwork. Randomization in Byzantine agreement. Advances in Computing Research, 5:443--498, 1989.","journal-title":"Advances in Computing Research"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.14"},{"key":"e_1_3_2_1_10_1","volume-title":"ACM Transactions on Algorithms(TALG)","author":"Kapron B.","year":"2009","unstructured":"B. Kapron , D. Kempe , V. King , J. Saia , and V. Sanwalani . Scalable algorithms for byzantine agreement and leader election with full information . ACM Transactions on Algorithms(TALG) , 2009 . B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Scalable algorithms for byzantine agreement and leader election with full information. ACM Transactions on Algorithms(TALG), 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"}],"event":{"name":"PODC '13: 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":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"PODC '13"},"container-title":["Proceedings of the 2013 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484239.2484288","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484239.2484288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:19Z","timestamp":1750235959000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484239.2484288"}},"subtitle":["byzantine agreement with a strong adversary in polynomial expected time"],"short-title":[],"issued":{"date-parts":[[2013,7,22]]},"references-count":11,"alternative-id":["10.1145\/2484239.2484288","10.1145\/2484239"],"URL":"https:\/\/doi.org\/10.1145\/2484239.2484288","relation":{},"subject":[],"published":{"date-parts":[[2013,7,22]]},"assertion":[{"value":"2013-07-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}