{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:52:54Z","timestamp":1725483174091},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000730"},{"type":"electronic","value":"9783540361084"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36108-1_4","type":"book-chapter","created":{"date-parts":[[2007,5,4]],"date-time":"2007-05-04T00:38:36Z","timestamp":1178239116000},"page":"48-62","source":"Crossref","is-referenced-by-count":12,"title":["Condition-Based Protocols for Set Agreement Problems"],"prefix":"10.1007","author":[{"given":"A.","family":"Most\u00e9faoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"4_CR1","unstructured":"Attiya H. and Avidor Z., Wait-Free n-Consensus When Inputs are Restricted. Proc. 16th Symposium on Distributed Computing (DISC\u201902), These proceedings."},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539795279463","volume":"27","author":"H. Attiya","year":"1998","unstructured":"Attiya H. and Rachman O., Atomic Snapshots in O(n log n) Operations. SIAM Journal on Computing, 27(2):319\u2013340, 1998.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Attiya H. and Rajsbaum S., The Combinatorial Structure of Wait-free Solvable Tasks. To appear in SIAM Journal on Computing, 2002.","DOI":"10.1137\/S0097539797330689"},{"key":"4_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-68530-8_23","volume-title":"6th European Symposium on Algorithms","author":"P. Berman","year":"1998","unstructured":"Berman P. and Garay J., Adaptability and the Usefulness of Hints. 6th European Symposium on Algorithms, Springer-Verlag LNCS #1461, pp. 271\u2013282, 1998."},{"key":"4_CR5","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. and Zaks S., A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms, 11:420\u2013440, 1990.","journal-title":"Journal of Algorithms"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Borowsky E. and Gafni E., Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. Proc. 25th ACM STOC, pp. 91\u2013100, 1993.","DOI":"10.1145\/167088.167119"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225\u2013267, 1996.","journal-title":"Journal of the ACM"},{"key":"4_CR8","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, 105:132\u2013158, 1993.","journal-title":"Information and Computation"},{"issue":"1","key":"4_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. and Stockmeyer L., On the Minimal Synchronism Needed for Distributed Consensus. Journal of the ACM, 34(1):77\u201397, 1987.","journal-title":"Journal of the ACM"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork C., Lynch N. and Stockmeyer L., Consensus in the Presence of Partial Synchrony. Journal of the ACM, 35(2):288\u2013323, 1988.","journal-title":"Journal of the ACM"},{"issue":"2","key":"4_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. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374\u2013382, 1985.","journal-title":"Journal of the ACM"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539796305766","volume":"28","author":"E. Gafni","year":"1999","unstructured":"Gafni E. and Koutsoupias E., Three-Processor Tasks Are Undecidable. SIAM Journal of Computing, 28(3):970\u2013983, 1999.","journal-title":"SIAM Journal of Computing"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Herlihy M.P. and Rajsbaum S., On the Decidability of Distributed Decision Tasks. Proc. 29th ACM STOC, pp. 589\u2013598, 1997.","DOI":"10.1145\/258533.258652"},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-48340-3_16","volume-title":"Invited Talk, Proc. 24th Int. Symposium on Mathematical Foundations of Computer Science (MFCS\u201999)","author":"M. Herlihy","year":"1999","unstructured":"Herlihy M. and Rajsbaum S., New Perspectives in Distributed Computing. Invited Talk, Proc. 24th Int. Symposium on Mathematical Foundations of Computer Science (MFCS\u201999), Springer-Verlag LNCS #1672, pp. 170\u2013186, 1999."},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0960129500003170","volume":"10","author":"M. Herlihy","year":"2000","unstructured":"Herlihy M. and Rajsbaum S., Algebraic Spans. Mathematical Structures in Computer Science, 10(4):549\u2013573, 2000.","journal-title":"Mathematical Structures in Computer Science"},{"key":"4_CR16","unstructured":"Herlihy M., Rajsbaum S. and Tuttle M., Synchronous Round Operators, 2000."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Herlihy M. and Shavit N., The Asynchronous Computability Theorem for t- Resilient Tasks. Proc. 25th ACM STOC, CA, pp. 111\u2013120, 1993.","DOI":"10.1145\/167088.167125"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy M.P. and Wing J.M., Linearizability: a Correctness Condition for Concurrent Objects. A CM TOPLAS, 12(3):463\u2013492, 1990.","journal-title":"A CM TOPLAS"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/504192.504195","volume":"32","author":"I. Keidar","year":"2001","unstructured":"Keidar I. and Rajsbaum S., On the Cost of Fault-Tolerant Consensus When There Are No Faults \u2014 A Tutorial, SIGACT News, DC Column, 32(2):45\u201363, 2001.","journal-title":"SIGACT News, DC Column"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui A., Rajsbaum S. and Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. Proc. 33rd ACM STOC, pp. 153\u2013162, 2001.","DOI":"10.1145\/380752.380792"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui A., Rajsbaum S., Raynal M. and Roy M., A Hierarchy of Conditions for Consensus Solvability. Proc. PODC\u201901, pp. 151\u2013160, 2001.","DOI":"10.1145\/383962.384006"},{"key":"4_CR22","volume-title":"Research Reports #1464","author":"A. Most\u00e9faoui","year":"2002","unstructured":"Most\u00e9faoui A., Rajsbaum S., Raynal M. and Roy M., Condition-Based Protocols for Set Agreement Problems. Research Reports #1464, IRISA, University of Rennes, France, 2002. http:\/\/www.irisa.fr\/bibli\/publi\/pi\/2002\/1464\/1464.html ."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Mostefaoui A. and Raynal M., k-Set Agreement with Limited Accuracy Failure Detectors. Proc. PODC\u201999, Portland (OR), pp. 143\u2013152, 2000.","DOI":"10.1145\/343477.343536"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Mostefaoui A. and Raynal M., Randomized k-Set Agreement. Proc. 13th th ACM Symp. on Parallel Algorithms and Architectures (SPAA\u201901), pp. 291\u2013297, 2001.","DOI":"10.1145\/378580.378690"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/inco.1994.1068","volume":"113","author":"G. Taubenfeld","year":"1994","unstructured":"Taubenfeld G., Katz S. and Moran S., Impossibility Results in the Presence of Multiple Faulty Processes. Information and Computation, 113(2):173\u2013198, 1994.","journal-title":"Information and Computation"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002360050034","volume":"35","author":"G. Taubenfeld","year":"1996","unstructured":"Taubenfeld G. and Moran S., Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica, 35:1\u201320, 1996.","journal-title":"Acta Informatica"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Saks M. and Zaharoglou F., Wait-Free k-Set Agreement is Impossible: the Topology of Public Knowledge. Proc. 25th ACM STOC, pp. 101\u2013110, 1993.","DOI":"10.1145\/167088.167122"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36108-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T18:17:34Z","timestamp":1556389054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36108-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000730","9783540361084"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-36108-1_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}