{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:25:55Z","timestamp":1756571155353,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538425","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"60-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["A Recursive Early-Stopping Phase King Protocol"],"prefix":"10.1145","author":[{"given":"Christoph","family":"Lenzen","sequence":"first","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbruecken, Germany"}]},{"given":"Sahar","family":"Sheikholeslami","sequence":"additional","affiliation":[{"name":"Ferdowsi University of Mashhad, Mashhad, Iran"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63511"},{"key":"e_1_3_2_1_2_1","volume-title":"Bit Optimal Distributed Consensus, page 313--321","author":"Berman Piotr","year":"1992","unstructured":"Piotr Berman , Juan A. Garay , and Kenneth J. Perry . Bit Optimal Distributed Consensus, page 313--321 . Plenum Press , USA , 1992 . Piotr Berman, Juan A. Garay, and Kenneth J. Perry. Bit Optimal Distributed Consensus, page 313--321. Plenum Press, USA, 1992."},{"key":"e_1_3_2_1_3_1","first-page":"221","volume-title":"Optimal Early Stopping in Distributed Consensus. In Distributed Algorithms","author":"Berman Piotr","year":"1992","unstructured":"Piotr Berman , Juan A. Garay , and Kenneth J . Perry . Optimal Early Stopping in Distributed Consensus. In Distributed Algorithms , pages 221 -- 237 , 1992 . Piotr Berman, Juan A. Garay, and Kenneth J. Perry. Optimal Early Stopping in Distributed Consensus. In Distributed Algorithms, pages 221--237, 1992."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_5_1","first-page":"206","volume-title":"International Conference on Networked Systems (NETYS)","author":"Armando Casta","year":"2017","unstructured":"Armando Casta neda, Yoram Moses , Michel Raynal , and Matthieu Roy . Early decision and stopping in synchronous consensus: a predicate-based guided tour . In International Conference on Networked Systems (NETYS) , pages 206 -- 221 , 2017 . Armando Casta neda, Yoram Moses, Michel Raynal, and Matthieu Roy. Early decision and stopping in synchronous consensus: a predicate-based guided tour. In International Conference on Networked Systems (NETYS), pages 206--221, 2017."},{"key":"e_1_3_2_1_6_1","first-page":"289","volume-title":"Deepak Chandra and Sam Toueg. Time and Message Efficient Reliable Broadcasts. In Workshop on Distributed Algorithms (WDAG)","author":"Tushar","year":"1990","unstructured":"Tushar Deepak Chandra and Sam Toueg. Time and Message Efficient Reliable Broadcasts. In Workshop on Distributed Algorithms (WDAG) , pages 289 -- 303 , 1990 . Tushar Deepak Chandra and Sam Toueg. Time and Message Efficient Reliable Broadcasts. In Workshop on Distributed Algorithms (WDAG), pages 289--303, 1990."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.08.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_22"},{"key":"e_1_3_2_1_9_1","first-page":"1","volume-title":"Jan Olkowski. Fast Agreement in Networks with Byzantine Nodes. In Symposium on Distributed Computing (DISC)","volume":"179","author":"Chlebus Bogdan S.","year":"2020","unstructured":"Bogdan S. Chlebus , Dariusz R. Kowalski , and Jan Olkowski. Fast Agreement in Networks with Byzantine Nodes. In Symposium on Distributed Computing (DISC) , volume 179 , pages 30: 1 -- 30 :18, 2020 . Bogdan S. Chlebus, Dariusz R. Kowalski, and Jan Olkowski. Fast Agreement in Networks with Byzantine Nodes. In Symposium on Distributed Computing (DISC), volume 179, pages 30:1--30:18, 2020."},{"key":"e_1_3_2_1_10_1","first-page":"63","volume-title":"Coan. A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols. In Symposium on Principles of Distributed Computing (PODC)","author":"Brian","year":"1986","unstructured":"Brian A Coan. A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols. In Symposium on Principles of Distributed Computing (PODC) , pages 63 -- 72 , 1986 . Brian A Coan. A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols. In Symposium on Principles of Distributed Computing (PODC), pages 63--72, 1986."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1709404.1709409"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484269"},{"key":"e_1_3_2_1_14_1","volume-title":"Bounds on Information Exchange for Byzantine Agreement. Journal of the ACM (JACM), 32(1):191--204","author":"Dolev Danny","year":"1985","unstructured":"Danny Dolev and R\u00fcdiger Reischuk . Bounds on Information Exchange for Byzantine Agreement. Journal of the ACM (JACM), 32(1):191--204 , 1985 . Danny Dolev and R\u00fcdiger Reischuk. Bounds on Information Exchange for Byzantine Agreement. Journal of the ACM (JACM), 32(1):191--204, 1985."},{"key":"e_1_3_2_1_15_1","series-title":"SIAM Journal on Computing (SICOMP), 12(4):656--666","volume-title":"Authenticated Algorithms for Byzantine Agreement","author":"Dolev Danny","year":"1983","unstructured":"Danny Dolev and H. Raymond Strong . Authenticated Algorithms for Byzantine Agreement . SIAM Journal on Computing (SICOMP), 12(4):656--666 , 1983 . Danny Dolev and H. Raymond Strong. Authenticated Algorithms for Byzantine Agreement. SIAM Journal on Computing (SICOMP), 12(4):656--666, 1983."},{"key":"e_1_3_2_1_16_1","first-page":"148","volume-title":"Feldman and Silvio Micali. Optimal Algorithms for Byzantine Agreement. In Symposium on Theory of Computing (STOC)","author":"Paul","year":"1988","unstructured":"Paul Feldman and Silvio Micali. Optimal Algorithms for Byzantine Agreement. In Symposium on Theory of Computing (STOC) , pages 148 -- 161 , 1988 . Paul Feldman and Silvio Micali. Optimal Algorithms for Byzantine Agreement. In Symposium on Theory of Computing (STOC), pages 148--161, 1988."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492674"},{"key":"e_1_3_2_1_18_1","volume-title":"A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters (IPL), 85(1):47--52","author":"Keidar Idit","year":"2003","unstructured":"Idit Keidar and Sergio Rajsbaum . A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters (IPL), 85(1):47--52 , 2003 . Idit Keidar and Sergio Rajsbaum. A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters (IPL), 85(1):47--52, 2003."},{"key":"e_1_3_2_1_19_1","first-page":"142","volume-title":"Ulrich Schmid. Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. In Euromicro Conference on Digital System Design (DSE\/SEAA)","author":"Lenzen Christoph","year":"2013","unstructured":"Christoph Lenzen , Matthias F\u00fcgger , Markus Hofst\u00e4tter , and Ulrich Schmid. Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. In Euromicro Conference on Digital System Design (DSE\/SEAA) , pages 142 -- 151 , 2013 . Christoph Lenzen, Matthias F\u00fcgger, Markus Hofst\u00e4tter, and Ulrich Schmid. Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. In Euromicro Conference on Digital System Design (DSE\/SEAA), pages 142--151, 2013."},{"key":"e_1_3_2_1_20_1","volume-title":"Distributed algorithms","author":"Lynch Nancy A","year":"1996","unstructured":"Nancy A Lynch . Distributed algorithms . Elsevier , 1996 . Nancy A Lynch. Distributed algorithms. Elsevier, 1996."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007963"},{"key":"e_1_3_2_1_22_1","volume-title":"Reaching Agreement in the Presence of Faults. Journal of the ACM (JACM), 27(2):228--234","author":"Pease Marshall C.","year":"1980","unstructured":"Marshall C. Pease , Robert E. Shostak , and Leslie Lamport . Reaching Agreement in the Presence of Faults. Journal of the ACM (JACM), 27(2):228--234 , 1980 . Marshall C. Pease, Robert E. Shostak, and Leslie Lamport. Reaching Agreement in the Presence of Faults. Journal of the ACM (JACM), 27(2):228--234, 1980."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1986.6312888"},{"key":"e_1_3_2_1_24_1","volume-title":"Strongly Terminating Early-stopping k-set Agreement in Synchronous Systems with General Omission Failures. Theory of Computing Systems (TCS), 47(1):259--287","author":"Parv\u00e9dy Philippe Raipin","year":"2010","unstructured":"Philippe Raipin Parv\u00e9dy , Michel Raynal , and Corentin Travers . Strongly Terminating Early-stopping k-set Agreement in Synchronous Systems with General Omission Failures. Theory of Computing Systems (TCS), 47(1):259--287 , 2010 . Philippe Raipin Parv\u00e9dy, Michel Raynal, and Corentin Travers. Strongly Terminating Early-stopping k-set Agreement in Synchronous Systems with General Omission Failures. Theory of Computing Systems (TCS), 47(1):259--287, 2010."},{"key":"e_1_3_2_1_25_1","first-page":"71","volume-title":"Sam Toueg. Optimal Clock Synchronization. In Symposium on Principles of Distributed Computing (PODC)","author":"Srikanth T.K.","year":"1985","unstructured":"T.K. Srikanth and Sam Toueg. Optimal Clock Synchronization. In Symposium on Principles of Distributed Computing (PODC) , pages 71 -- 86 , 1985 . T.K. Srikanth and Sam Toueg. Optimal Clock Synchronization. In Symposium on Principles of Distributed Computing (PODC), pages 71--86, 1985."}],"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.3538425","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":25,"alternative-id":["10.1145\/3519270.3538425","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538425","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"}}]}}