{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335574,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["2131538"],"award-info":[{"award-number":["2131538"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538471","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"106-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency"],"prefix":"10.1145","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[{"name":"Augusta University, Augusta, GA, USA"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[{"name":"Augusta University, Augusta, GA, USA"}]},{"given":"Jan","family":"Olkowski","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0315-1"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277733"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90035-E"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG'92)","volume":"237","author":"Berman Piotr","unstructured":"Piotr Berman , Juan A. Garay , and Kenneth J. Perry . 1992. Optimal early stopping in distributed consensus (extended abstract) . In Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG'92) (Lecture Notes in Computer Science , Vol. 647). Springer, 221-- 237 . Piotr Berman, Juan A. Garay, and Kenneth J. Perry. 1992. Optimal early stopping in distributed consensus (extended abstract). In Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG'92) (Lecture Notes in Computer Science, Vol. 647). Springer, 221--237."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.02.003"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.08.001"},{"key":"e_1_3_2_2_7_1","volume-title":"Proceedings of the 20th International Symposium on Distributed Computing (DISC'06)","volume":"328","author":"Bogdan","unstructured":"Bogdan S. Chlebus and Dariusz R. Kowalski. 2006. Time and communication efficient consensus for crash failures . In Proceedings of the 20th International Symposium on Distributed Computing (DISC'06) (Lecture Notes in Computer Science , Vol. 4167). Springer, 314-- 328 . Bogdan S. Chlebus and Dariusz R. Kowalski. 2006. Time and communication efficient consensus for crash failures. In Proceedings of the 20th International Symposium on Distributed Computing (DISC'06) (Lecture Notes in Computer Science, Vol. 4167). Springer, 314--328."},{"volume-title":"Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'09)","author":"Bogdan","key":"e_1_3_2_2_8_1","unstructured":"Bogdan S. Chlebus and Dariusz R. Kowalski. 2009. Locally scalable randomized consensus for synchronous crash failures . In Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'09) . ACM, 290--299. Bogdan S. Chlebus and Dariusz R. Kowalski. 2009. Locally scalable randomized consensus for synchronous crash failures. In Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'09). ACM, 290--299."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582738"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_24"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65956"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280838"},{"volume-title":"Elementary Number Theory","author":"Davidoff Giuliana","key":"e_1_3_2_2_13_1","unstructured":"Giuliana Davidoff , Peter Sarnak , and Alain Valette . 2003. Elementary Number Theory , Group Theory, and Ramanujan Graphs. Cambridge University Press . Giuliana Davidoff, Peter Sarnak, and Alain Valette. 2003. Elementary Number Theory, Group Theory, and Ramanujan Graphs. Cambridge University Press."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198082"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484269"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/96559.96565"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492674"},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings of the 21st International Symposium on Distributed Computing (DISC'07)","volume":"297","author":"Gilbert Seth","unstructured":"Seth Gilbert , Rachid Guerraoui , and Dariusz R. Kowalski . 2007. On the message complexity of indulgent consensus . In Proceedings of the 21st International Symposium on Distributed Computing (DISC'07) (Lecture Notes in Computer Science , Vol. 4731). Springer, 283-- 297 . Seth Gilbert, Rachid Guerraoui, and Dariusz R. Kowalski. 2007. On the message complexity of indulgent consensus. In Proceedings of the 21st International Symposium on Distributed Computing (DISC'07) (Lecture Notes in Computer Science, Vol. 4731). Springer, 283--297."},{"key":"e_1_3_2_2_19_1","volume-title":"Kowalski","author":"Gilbert Seth","year":"2010","unstructured":"Seth Gilbert and Dariusz R . Kowalski . 2010 . Distributed agreement with optimal communication complexity. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10). SIAM , 965--977. Seth Gilbert and Dariusz R. Kowalski. 2010. Distributed agreement with optimal communication complexity. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10). SIAM, 965--977."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"e_1_3_2_2_21_1","volume-title":"Kowalski and Jaroslaw Mirek","author":"Dariusz","year":"2019","unstructured":"Dariusz R. Kowalski and Jaroslaw Mirek . 2019 . On the complexity of fault-tolerant consensus. In Revised Selected Papers from the 7th International Conference on Networked Systems (NETYS'19) (Lecture Notes in Computer Science , Vol. 11704). Springer, 19-- 31 . Dariusz R. Kowalski and Jaroslaw Mirek. 2019. On the complexity of fault-tolerant consensus. In Revised Selected Papers from the 7th International Conference on Networked Systems (NETYS'19) (Lecture Notes in Computer Science, Vol. 11704). Springer, 19--31."},{"volume-title":"Expander Families and Cayley Graphs: a beginner's guide","author":"Krebs Mike","key":"e_1_3_2_2_22_1","unstructured":"Mike Krebs and Anthony Shaheen . 2011. Expander Families and Cayley Graphs: a beginner's guide . Oxford University Press . Mike Krebs and Anthony Shaheen. 2011. Expander Families and Cayley Graphs: a beginner's guide. Oxford University Press."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210399"}],"event":{"name":"PODC '22: 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":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538471","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538471","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":23,"alternative-id":["10.1145\/3519270.3538471","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538471","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}