{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:25:52Z","timestamp":1743139552156,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031673207"},{"type":"electronic","value":"9783031673214"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-67321-4_5","type":"book-chapter","created":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T16:02:07Z","timestamp":1724515327000},"page":"83-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Some New Results With 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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3250-716X","authenticated-orcid":false,"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1747-2365","authenticated-orcid":false,"given":"Mouna","family":"Safir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,25]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Afek, Y., Dolev, D., Attiya, H., Gafni, E., Merritt, M., Shavit, N.: Atomic Snapshots of Shared Memory, vol.\u00a040, pp. 1\u201313 (1990). https:\/\/doi.org\/10.1145\/93385.93394","DOI":"10.1145\/93385.93394"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM 42(1), 124\u2013142 (1995). https:\/\/doi.org\/10.1145\/200836.200869","DOI":"10.1145\/200836.200869"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 16\u201318 May 1993, San Diego, pp. 91\u2013100. ACM (1993)","DOI":"10.1145\/167088.167119"},{"issue":"12","key":"5_CR4","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":"5_CR5","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":"5_CR6","doi-asserted-by":"publisher","unstructured":"Chaudhuri, S., Herlihy, M., Lynch, N.A., Tuttle, M.R.: Tight bounds for k-set agreement. J. ACM 47(5), 912\u2013943 (2000). https:\/\/doi.org\/10.1145\/355483.355489","DOI":"10.1145\/355483.355489"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Civit, P., Gilbert, S., Guerraoui, R., Komatovic, J., Vidigueira, M.: On the validity of consensus. In: Oshman, R., Nolin, A., Halld\u00f3rsson, M.M., Balliu, A. (eds.) Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, 19\u201323 June 2023, pp. 332\u2013343. ACM (2023), https:\/\/doi.org\/10.1145\/3583668.3594567","DOI":"10.1145\/3583668.3594567"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Raynal, M., Safir, M.: Optimal algorithms for synchronous byzantine k-set agreement. Theor. Comput. Sci. 973, 114098 (2023). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397523004115","DOI":"10.1016\/j.tcs.2023.114098"},{"issue":"2","key":"5_CR9","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.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for t-resilient tasks. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 16\u201318 May 1993, San Diego, pp. 111\u2013120. ACM (1993)","DOI":"10.1145\/167088.167125"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, 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":"5_CR12","unstructured":"Lorenzo, A.: Consensus and Reliable Broadcast (2006). http:\/\/www.cs.utexas.edu\/users\/lorenzo\/corsi\/cs371d\/08F\/notes\/week8.pdf"},{"key":"5_CR13","unstructured":"Lynch, N.A.: Distributed Algorithms. Elsevier (1996)"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). https:\/\/doi.org\/10.1145\/322186.322188","DOI":"10.1145\/322186.322188"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Prisco, R.D., Malkhi, D., Reiter, M.K.: On k-set consensus problems in asynchronous systems. IEEE Trans. Parallel Distributed Syst. 12(1), 7\u201321 (2001). https:\/\/doi.org\/10.1109\/71.899936","DOI":"10.1109\/71.899936"},{"issue":"1","key":"5_CR16","first-page":"1","volume":"1","author":"M Raynal","year":"2010","unstructured":"Raynal, M.: Fault-tolerant agreement in synchronous message-passing systems. Synth. Lect. Distrib. Comput. Theory 1(1), 1\u2013189 (2010)","journal-title":"Synth. Lect. Distrib. Comput. Theory"},{"issue":"5","key":"5_CR17","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."},{"issue":"6","key":"5_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/2.153253","volume":"25","author":"J Turek","year":"1992","unstructured":"Turek, J., Shasha, D.: The many faces of consensus in distributed systems. Computer 25(6), 8\u201317 (1992). https:\/\/doi.org\/10.1109\/2.153253","journal-title":"Computer"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-67321-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T16:03:06Z","timestamp":1724515386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-67321-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031673207","9783031673214"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-67321-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/netys.net\/committees\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}