{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:12:03Z","timestamp":1787501523006,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540354741","type":"print"},{"value":"9783540354758","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_15","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T10:45:59Z","timestamp":1151059559000},"page":"182-196","source":"Crossref","is-referenced-by-count":5,"title":["Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures"],"prefix":"10.1007","author":[{"given":"Philippe Ra\u00efpin","family":"Parv\u00e9dy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","volume":"71","author":"M.K. Aguilera","year":"1999","unstructured":"Aguilera, M.K., Toueg, S.: A Simple Bivalency Proof that t-Resilient Consensus Requires t\u2009+\u20091 Rounds. Information Processing Letters\u00a071, 155\u2013178 (1999)","journal-title":"Information Processing Letters"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing, Fundamentals, Simulation and Advanced Topics, 2nd edn. Wiley Series on Parallel and Distributed Computing, pages 414 (2004)","DOI":"10.1002\/0471478210"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O. Biran","year":"1990","unstructured":"Biran, O., Moran, S., Zaks, S.: A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms\u00a011(3), 420\u2013440 (1990)","journal-title":"Journal of Algorithms"},{"issue":"1-2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0304-3975(94)00157-E","volume":"145","author":"O. Biran","year":"1995","unstructured":"Biran, O., Moran, S., Zaks, S.: Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. Theoretical Computer Science\u00a0145(1-2), 271\u2013290 (1995)","journal-title":"Theoretical Computer Science"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E., Generalized, F.L.P.: Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computation (STOC 1993), California (USA), pp. 91\u2013100 (1993)","DOI":"10.1145\/167088.167119"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jalgor.2003.11.001","volume":"51","author":"B. Charron-Bost","year":"2004","unstructured":"Charron-Bost, B., Schiper, A.: Uniform Consensus is Harder than Consensus. Journal of Algorithms\u00a051(1), 15\u201337 (2004)","journal-title":"Journal of Algorithms"},{"key":"15_CR7","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. Information and Computation\u00a0105, 132\u2013158 (1993)","journal-title":"Information and Computation"},{"issue":"5","key":"15_CR8","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1145\/355483.355489","volume":"47","author":"S. Chaudhuri","year":"2000","unstructured":"Chaudhuri, S., Herlihy, M., Lynch, N., Tuttle, M.: Tight Bounds for k-Set Agreement. Journal of the ACM\u00a047(5), 912\u2013943 (2000)","journal-title":"Journal of the ACM"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","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. Journal of the ACM\u00a037(4), 720\u2013741 (1990)","journal-title":"Journal of the ACM"},{"issue":"4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M.J. Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A Lower Bound on the Time to Assure Interactive Consistency. Information Processing Letters\u00a014(4), 183\u2013186 (1982)","journal-title":"Information Processing Letters"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","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. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Gafni, E., Guerraoui, R., Pochon, B.: >From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement. In: Proc. 37th ACM Symposium on Theory of Computing (STOC 2005), Baltimore (MD), pp. 714\u2013722 (May 2005)","DOI":"10.1145\/1060590.1060696"},{"key":"15_CR13","unstructured":"Guerraoui, R., Pochon, B.: The Complexity of Early Deciding Set Agreement: how Topology Can Help? In: Proc. 4th Workshop in Geometry and Topology in Concurrency and Distributed Computing (GETCO 2004), BRICS Notes Series, NS-04-2, Amsterdam (NL), pp. 26-31 (2004)"},{"key":"15_CR14","unstructured":"Hadzilacos, V.: Issues of Fault Tolerance in Concurrent Computations. PhD Thesis, Tech Report 11-84, Harvard University, Cambridge (MA) (1985)"},{"key":"15_CR15","first-page":"97","volume-title":"Distributed Systems","author":"V. Hadzilacos","year":"1993","unstructured":"Hadzilacos, V., Toueg, S.: Reliable Broadcast and Related Problems. In: Mullender, S. (ed.) Distributed Systems, pp. 97\u2013145. ACM Press, New York (1993)"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00446-005-0141-8","volume":"18","author":"M.P. Herlihy","year":"2005","unstructured":"Herlihy, M.P., Penso, L.D.: Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors. Distributed Computing\u00a018(2), 157\u2013166 (2005)","journal-title":"Distributed Computing"},{"issue":"6","key":"15_CR17","doi-asserted-by":"publisher","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. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0190(02)00333-2","volume":"85","author":"I. Keidar","year":"2003","unstructured":"Keidar, I., Rajsbaum, S.: A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters\u00a085, 47\u201352 (2003)","journal-title":"Information Processing Letters"},{"key":"15_CR19","unstructured":"Lamport, L., Fischer, M.: Byzantine Generals and Transaction Commit Protocols, p. 16 (April 1982) (unpublished manuscript)"},{"key":"15_CR20","first-page":"872","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms, p. 872. Morgan Kaufmann, San Fransisco (CA) (1996)"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/343477.343536","volume-title":"Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC 2000)","author":"A. Most\u00e9faoui","year":"2000","unstructured":"Most\u00e9faoui, A., Raynal, M.: k-Set Agreement with Limited Accuracy Failure Detectors. In: Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 143\u2013152. ACM Press, Portland, OR (2000)"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/378580.378690","volume-title":"Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001)","author":"A. Most\u00e9faoui","year":"2001","unstructured":"Most\u00e9faoui, A., Raynal, M.: Randomized Set Agreement. In: Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), Hersonissos (Crete), pp. 291\u2013297. ACM Press, New York (2001)"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger, G., Toueg, S.: Automatically Increasing the Fault-Tolerance of Distributed Algorithms. Journal of Algorithms\u00a011, 374\u2013419 (1990)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"L. Pease","year":"1980","unstructured":"Pease, L., Shostak, R., Lamport, L.: Reaching Agreement in Presence of Faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"issue":"3","key":"15_CR25","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"SE-12","author":"K.J. Perry","year":"1986","unstructured":"Perry, K.J., Toueg, S.: Distributed Agreement in the Presence of Processor and Communication Faults. IEEE Transactions on Software Eng.\u00a0SE-12(3), 477\u2013482 (1986)","journal-title":"IEEE Transactions on Software Eng."},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/1007912.1007963","volume-title":"Proc. 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2004)","author":"P.. Ra\u00edpin Parv\u00e9dy","year":"2004","unstructured":"Ra\u00edpin Parv\u00e9dy, P., Raynal, M.: Optimal Early Stopping Uniform Consensus in Synchronous Systems with Process Omission Failures. In: Proc. 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2004), Barcelona (Spain), pp. 302\u2013310. ACM Press, New York (2004)"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11535294_5","volume-title":"Parallel Computing Technologies","author":"P. Ra\u00efpin Parv\u00e9dy","year":"2005","unstructured":"Ra\u00efpin Parv\u00e9dy, P., Raynal, M., Travers, C.: Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes. In: Malyshkin, V.E. (ed.) PaCT 2005. LNCS, vol.\u00a03606, pp. 49\u201358. Springer, Heidelberg (2005)"},{"key":"15_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/PRDC.2005.28","volume-title":"Proc. 11th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC 2005)","author":"P.. Ra\u00edpin Parv\u00e9dy","year":"2005","unstructured":"Ra\u00edpin Parv\u00e9dy, P., Raynal, M., Travers, C.: Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures. In: Proc. 11th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC 2005), Changsa (China), pp. 23\u201330. IEEE Computer Press, Los Alamitos (2005)"},{"key":"15_CR29","unstructured":"Ra\u00efpin Parv\u00e9dy P., Raynal M., Travers C.: Strongly Terminating Early-Stopping k-set Agreement in Synchronous Systems with General Omission Failures. Tech Report #1711, IRISA, Universit\u00e9 de Rennes (France), pages 22 (2005), ftp:\/\/ftp.irisa.fr\/techreports\/2005\/PI-1711.ps.gz"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/PRDC.2002.1185641","volume-title":"Proc. 9th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC 2002)","author":"M. Raynal","year":"2002","unstructured":"Raynal, M.: Consensus in Synchronous Systems: a Concise Guided Tour. In: Proc. 9th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC 2002), pp. 221\u2013228. IEEE Computer Press, Tsukuba (Japan) (2002)"},{"issue":"5","key":"15_CR31","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 Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/277697.277755","volume-title":"Proc. 17th Int. ACM Symposium on Principles of Distributed Computing (PODC 1998)","author":"J. Yang","year":"1998","unstructured":"Yang, J., Neiger, G., Gafni, E.: Structured Derivations of Consensus Algorithms for Failure Detectors. In: Proc. 17th Int. ACM Symposium on Principles of Distributed Computing (PODC 1998), Puerto Vallarta (Mexico), July 1998, pp. 297\u2013308. ACM Press, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:09Z","timestamp":1619493429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11780823_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}