{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:34:24Z","timestamp":1725834864742},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252575"},{"type":"electronic","value":"9783319252582"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_27","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T03:10:18Z","timestamp":1445224218000},"page":"385-398","source":"Crossref","is-referenced-by-count":0,"title":["A Separation of n-consensus and (n\u2009+\u20091)-consensus Based on Process Scheduling"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00446-012-0158-8","volume":"25","author":"M.K. Aguilera","year":"2012","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Partial synchrony based on set timeliness. Distributed Computing\u00a025(3), 249\u2013260 (2012)","journal-title":"Distributed Computing"},{"issue":"5-6","key":"27_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00446-010-0106-4","volume":"22","author":"M.K. Aguilera","year":"2010","unstructured":"Aguilera, M.K., Toueg, S.: Adaptive progress: a gracefully-degrading liveness property. Distributed Computing\u00a022(5-6), 303\u2013334 (2010)","journal-title":"Distributed Computing"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1109\/TPDS.2013.77","volume":"25","author":"M. Biely","year":"2014","unstructured":"Biely, M., Robinson, P., Schmid, U.: The generalized loneliness detector and weak system models for k-set agreement. IEEE Trans. Parallel Distrib. Syst.\u00a025(4), 1078\u20131088 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 91\u2013100 (1993)","DOI":"10.1145\/167088.167119"},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-40148-0_3","volume-title":"Networked Systems","author":"C. Delporte-Gallet","year":"2013","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Rajsbaum, S.: Black art: Obstruction-free k-set agreement with |MWMR\u00a0registers| <\u00a0|proccesses|. In: Gramoli, V., Guerraoui, R. (eds.) NETYS 2013. LNCS, vol.\u00a07853, pp. 28\u201341. Springer, Heidelberg (2013)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Tight failure detection bounds on atomic object implementations. Journal of the ACM 57(4), April 2010","DOI":"10.1145\/1734213.1734216"},{"issue":"3-4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00446-010-0122-4","volume":"24","author":"C. Delporte-Gallet","year":"2011","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. Distributed Computing\u00a024(3-4), 137\u2013147 (2011)","journal-title":"Distributed Computing"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.J.: On the minimal synchronism needed for distributed consensus. Journal of the ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of the ACM"},{"issue":"2","key":"27_CR10","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.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P.: The weakest failure detector for solving k-set agreement. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 83\u201391 (2009)","DOI":"10.1145\/1582716.1582735"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"27_CR13","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: ICDCS 2003: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 522\u2013529. IEEE Computer Society, May 2003"},{"issue":"6","key":"27_CR14","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"issue":"31","key":"27_CR15","first-page":"163","volume":"4","author":"M. Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research\u00a04(31), 163\u2013183 (1987)","journal-title":"Advances in Computing Research"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-17653-1_15","volume-title":"Principles of Distributed Systems","author":"S.M. Pike","year":"2010","unstructured":"Pike, S.M., Sastry, S., Welch, J.L.: Failure detectors encapsulate fairness. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 173\u2013188. Springer, Heidelberg (2010)"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-540-69733-6_48","volume-title":"Computing and Combinatorics","author":"S. Rajsbaum","year":"2008","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: The iterated restricted immediate snapshot model. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 487\u2013497. Springer, Heidelberg (2008)"},{"issue":"5","key":"27_CR18","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.\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"issue":"5-6","key":"27_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00446-010-0101-9","volume":"22","author":"P. Zielinski","year":"2010","unstructured":"Zielinski, P.: Anti-\u03a9: the weakest failure detector for set agreement. Distributed Computing\u00a022(5-6), 335\u2013348 (2010)","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T03:50:15Z","timestamp":1559274615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}