{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:38:09Z","timestamp":1761957489217,"version":"build-2065373602"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T00:00:00Z","timestamp":1257206400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00446-009-0090-8","type":"journal-article","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T13:51:28Z","timestamp":1257169888000},"page":"185-195","source":"Crossref","is-referenced-by-count":24,"title":["The k-simultaneous consensus problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,3]]},"reference":[{"issue":"4","key":"90_CR1","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek Y., Attiya H., Dolev D., Gafni E., Merritt M., Shavit N.: Atomic snapshots of shared memory. J. ACM. 40(4), 873\u2013890 (1993)","journal-title":"J. ACM."},{"issue":"1","key":"90_CR2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya H., Bar-Noy A., Dolev D.: Sharing memory robustly in message-passing systems. J. ACM. 42(1), 124\u2013142 (1995)","journal-title":"J. ACM."},{"key":"90_CR3","doi-asserted-by":"crossref","unstructured":"Afek Y., Gafni E., Rajsbaum S., Raynal M., Travers, C.: Simultaneous consensus tasks: a tighter characterization of set consensus. Proceedings of the 8th international conference on distributed computing and networking (ICDCN\u201906), Springer-Verlag LNCS #4308, pp. 331\u2013341 (2006)","DOI":"10.1007\/11947950_36"},{"issue":"2","key":"90_CR4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/992287.992298","volume":"35","author":"M. Aguilera","year":"2004","unstructured":"Aguilera M.: A pleasant stroll through the land of infinitely many creatures. ACM SIGACT News, Distrib. Comput. Column. 35(2), 36\u201359 (2004)","journal-title":"ACM SIGACT News, Distrib. Comput. Column."},{"key":"90_CR5","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. p. 414, 2nd edn. Wiley-Interscience, New York (2004)","DOI":"10.1002\/0471478210"},{"key":"90_CR6","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 (1993)","DOI":"10.1145\/167088.167119"},{"key":"90_CR7","doi-asserted-by":"crossref","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, 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"issue":"4","key":"90_CR8","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev D., Reischuk R., Strong R.: Early stopping in byzantine agreement. J. ACM. 37(4), 720\u2013741 (1990) April","journal-title":"J. ACM."},{"issue":"2","key":"90_CR9","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","volume":"88","author":"C. Dwork","year":"1990","unstructured":"Dwork C., Moses Y.: Knowledge and common knowledge in a byzantine environment: crash failures. Inf. Comput. 88(2), 156\u2013186 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"90_CR10","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. 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."},{"key":"90_CR11","doi-asserted-by":"crossref","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proceedings of the 20th ACM symposium on principles of distributed computing (PODC\u201901), ACM Press, pp. 161\u2013170 (2001)","DOI":"10.1145\/383962.384008"},{"key":"90_CR12","doi-asserted-by":"crossref","unstructured":"Gafni, E., Rajsbaum, S.: Musical benches. In: Proceedings of the 19th international symposium on distributed computing (DISC\u201905), Springer Verlag LNCS #3724, pp. 63\u201377 (2005)","DOI":"10.1007\/11561927_7"},{"key":"90_CR13","doi-asserted-by":"crossref","unstructured":"Gafni, E., Rajsbaum, R., Raynal, M. Travers, C.: The committee decision problem. In: Proceedings of the 8th Latin American theoretical informatics (LATIN\u201906), Springer-Verlag LNCS #3887, pp. 502\u2013514 (2006)","DOI":"10.1007\/11682462_47"},{"issue":"1","key":"90_CR14","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy M.P.: Wait-free synchronization. ACM Trans. Program. Languages Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Languages Syst."},{"issue":"6","key":"90_CR15","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M.P. 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":"90_CR16","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy M.P., Wing J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Languages Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Languages Syst."},{"issue":"2","key":"90_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport L.: On interprocess communication, Part 1: models, part 2: algorithms. Distrib. Comput. 1(2), 77\u2013101 (1986)","journal-title":"Distrib. Comput."},{"key":"90_CR18","first-page":"163","volume":"4","author":"M.C. Loui","year":"1987","unstructured":"Loui M.C., Abu-Amara H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res., JAI Press 4, 163\u2013183 (1987)","journal-title":"Adv. Comput. Res., JAI Press"},{"key":"90_CR19","unstructured":"Lynch, N.A.: Distributed Algorithms, p. 872. Morgan Kaufmann Pub, San Francisco (CA) (1996)"},{"key":"90_CR20","doi-asserted-by":"crossref","unstructured":"Merritt, M., Taubenfeld, G.: Computing with infinitely many processes. In: Proceedings of the 14th international symposium on distributed computing (DISC\u201900), Springer-Verlag LNCS #1914, pp. 164\u2013178 (2000)","DOI":"10.1007\/3-540-40026-5_11"},{"key":"90_CR21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0020-0190(00)00027-2","volume":"73","author":"A. Most\u00e9faoui","year":"2000","unstructured":"Most\u00e9faoui A., Raynal M., Tronel F.: From binary consensus to multivalued consensus in asynchronous message-passing systems. Inf. Process. Lett. 73, 207\u2013213 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"90_CR22","doi-asserted-by":"crossref","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":"90_CR23","doi-asserted-by":"crossref","unstructured":"Zieli\u0144sky, P.: Anti-\u03a9: the weakest failure detector for set agreement. In: Proceedings of the 27th ACM symposium on principles of distributed computing (PODC\u201908), ACM Press, pp. 55\u201364 (2008)","DOI":"10.1145\/1400751.1400761"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0090-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-009-0090-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0090-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:43Z","timestamp":1559136403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-009-0090-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["90"],"URL":"https:\/\/doi.org\/10.1007\/s00446-009-0090-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2009,11,3]]}}}