{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:19Z","timestamp":1759637839070,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031210167"},{"type":"electronic","value":"9783031210174"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21017-4_12","type":"book-chapter","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T18:06:34Z","timestamp":1667930794000},"page":"178-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Algorithms for\u00a0Synchronous Byzantine k-Set Agreement"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7946-6708","authenticated-orcid":false,"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3250-716X","authenticated-orcid":false,"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3355-8719","authenticated-orcid":false,"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1747-2365","authenticated-orcid":false,"given":"Mouna","family":"Safir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing, Fundamentals, Simulation and Advanced Topics. Wiley Series on Parallel and Distributed Computing, 2nd edn., p. 414. New Jersey (2004)","DOI":"10.1002\/0471478210"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility results for $$t$$-resilient asynchronous computations. In: Proceedings of the 25th ACM Symposium on Theory of Computing (STOC\u201993), pp. 91\u2013100. ACM Press (1993)","DOI":"10.1145\/167088.167119"},{"issue":"12","key":"12_CR3","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.ipl.2016.06.009","volume":"116","author":"Z Bouzid","year":"2016","unstructured":"Bouzid, Z., Imbs, D., Raynal, M.: A necessary condition for Byzantine $$k$$-set agreement. Inf. Process. Lett. 116(12), 757\u2013759 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-67087-0_12","volume-title":"Networked Systems","author":"C Delporte-Gallet","year":"2021","unstructured":"Delporte-Gallet, C., Fauconnier, H., Safir, M.: Byzantine k-set agreement. In: Georgiou, C., Majumdar, R. (eds.) NETYS 2020. LNCS, vol. 12129, pp. 183\u2013191. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67087-0_12"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"MP Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostack, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Raynal, M.: Distributed Algorithms For Message-passing Systems, p. 510. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38123-2. ISBN 978-3-642-38122-5","DOI":"10.1007\/978-3-642-38123-2"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-319-94141-7.pdf","volume-title":"Fault-tolerant Message-passing Distributed Systems: An Algorithmic Approach","author":"M Raynal","year":"2018","unstructured":"Raynal, M.: Fault-tolerant Message-passing Distributed Systems: An Algorithmic Approach, p. 480. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-94141-7.pdfISBN 978-3-319-94140-0"},{"issue":"5","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-free $$k$$-set agreement is impossible: the topology of public knowledge. SIAM J. Comput. 29(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Wuu, G.T.J., Bernstein, A.J.: Efficient solutions to the replicated log and dictionary problems. In: Proceeding of the 3rd Annual ACM Symposium on Principles of Distributed Computing (PODC 1984), pp. 233\u2013242. ACM Press (1984)","DOI":"10.1145\/800222.806750"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21017-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T18:08:55Z","timestamp":1667930935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21017-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210167","9783031210174"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21017-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2022.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}