{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:27:25Z","timestamp":1725474445158},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499909"},{"type":"electronic","value":"9783540499916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11945529_3","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T12:18:52Z","timestamp":1164629932000},"page":"20-35","source":"Crossref","is-referenced-by-count":5,"title":["A Topological Treatment of Early-Deciding Set-Agreement"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bastian","family":"Pochon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"91","volume-title":"Proceedings of the 25 th ACM Symposium on the Theory of Computing (STOC 1993)","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computation. In: Proceedings of the 25 th ACM Symposium on the Theory of Computing (STOC 1993), pp. 91\u2013100. ACM Press, New York (1993)"},{"issue":"1","key":"3_CR2","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"},{"issue":"1","key":"3_CR3","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(1), 132\u2013158 (1993)","journal-title":"Information and Computation"},{"issue":"5","key":"3_CR4","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":"3_CR5","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, H.R.: Early stopping in Byzantine agreement. Journal of the ACM\u00a037(4), 720\u2013741 (1990)","journal-title":"Journal of the ACM"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00446-005-0124-9","volume":"18","author":"P. Dutta","year":"2005","unstructured":"Dutta, P., Guerraoui, R.: The inherent price of indulgence. Distributed Computing\u00a018(1), 85\u201398 (2005)","journal-title":"Distributed Computing"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-39989-6_19","volume-title":"Distributed Computing","author":"P.S. Dutta","year":"2003","unstructured":"Dutta, P.S., Guerraoui, R., Pochon, B.: Tight bounds on early local decisions in uniform consensus. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 264\u2013278. Springer, Heidelberg (2003)"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of ACM"},{"issue":"2","key":"3_CR9","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":"3_CR10","unstructured":"Gafni, E.: Round-by-round fault detector \u2014 unifying synchrony and asynchrony. In: Proceedings of the 17 th ACM Symposium on Principles of Distributed Computing (PODC 1998) (1998)"},{"key":"3_CR11","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: Proceedings of the 37 th ACM Symposium on Theory of Computing (STOC 2005) (May 2005)","DOI":"10.1145\/1060590.1060696"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kouznetsov, P., Pochon, B.: A note on set agreement with omission failures. Electronic Notes in Theoretical Computing Science\u00a081 (2003)","DOI":"10.1016\/S1571-0661(04)80835-1"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/224964.224975","volume-title":"Proceedings of the 14 th ACM Symposium on Principles of Distributed Domputing (PODC 1995)","author":"M. Herlihy","year":"1995","unstructured":"Herlihy, M., Rajsbaum, S.: Algebraic spans. In: Proceedings of the 14 th ACM Symposium on Principles of Distributed Domputing (PODC 1995), pp. 90\u201399. ACM Press, New York (1995)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S., Tuttle, M.: Unifying synchronous and asynchronous message-passing models. In: Proceedings of the 17 th ACM Symposium on Principles of Distributed Computing (PODC 1998), pp. 133\u2013142 (1998)","DOI":"10.1145\/277697.277722"},{"issue":"6","key":"3_CR15","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":"2","key":"3_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/504192.504195","volume":"32","author":"I. Keidar","year":"2001","unstructured":"Keidar, I., Rajsbaum, S.: On the cost of fault-tolerant consensus when there are no faults \u2013 a tutorial. SIGACT News, Distributed Computing Column\u00a032(2), 45\u201363 (2001)","journal-title":"SIGACT News, Distributed Computing Column"},{"key":"3_CR17","volume-title":"Elements of Algebraic Topology","author":"J.R. Munkres","year":"1984","unstructured":"Munkres, J.R.: Elements of Algebraic Topology. Addison-Wesley, Reading (1984)"},{"issue":"5","key":"3_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 Journal on Computing\u00a029(5), 1449\u20131483 (2000); A preliminary version appeared in the Proceedings of the 25 th ACM Symposium on the Theory of Computing (STOC 1993)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11945529_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:18:18Z","timestamp":1619507898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11945529_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499909","9783540499916"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11945529_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}