{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:37:35Z","timestamp":1725892655020},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681397"},{"type":"electronic","value":"9783540681403"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11947950_38","type":"book-chapter","created":{"date-parts":[[2007,2,26]],"date-time":"2007-02-26T07:26:54Z","timestamp":1172474814000},"page":"349-354","source":"Crossref","is-referenced-by-count":5,"title":["Read-Write Reductions"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/93385.93394","volume-title":"Proc. 9th ACM Symposium on Principles of Distributed Computing (PODC 1990)","author":"Y. Afek","year":"1990","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merrit, M., Shavit, N.: Atomic Snapshots of Shared Memory. In: Proc. 9th ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 1\u201313. ACM Press, New York (1990)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/167088.167119","volume-title":"Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993)","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993), pp. 91\u2013100. ACM Press, New York (1993)"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/164051.164056","volume-title":"Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993)","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41\u201351. ACM Press, New York (1993)"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/259380.259439","volume-title":"Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997)","author":"E. Borowsky","year":"1997","unstructured":"Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 189\u2013198. ACM Press, New York (1997)"},{"issue":"3","key":"38_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E. Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG Distributed Simulation Algorithm. Distributed Computing\u00a014(3), 127\u2013146 (2001)","journal-title":"Distributed Computing"},{"key":"38_CR6","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":"2","key":"38_CR7","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":"38_CR8","unstructured":"Gafni, E.: DISC\/GODEL presentation: R\/WReductions, DISC 2004 (2004), \n                    \n                      http:\/\/www.cs.ucla.edu\/~eli\/eli\/godel.ppt"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/11947950_36","volume-title":"Distributed Computing and Networking","author":"Y. Afek","year":"2006","unstructured":"Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S., et al. (eds.) ICDCN 2006. LNCS, vol.\u00a04308, pp. 331\u2013341. Springer, Heidelberg (2006)"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-30186-8_3","volume-title":"Distributed Computing","author":"E. Gafni","year":"2004","unstructured":"Gafni, E.: Group-Solvability. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 30\u201340. Springer, Heidelberg (2004)"},{"key":"38_CR11","unstructured":"Gafni, E., Kouznetsov, P.: Two Front Agreement with Application to Emulation and Robustness (to appear)"},{"issue":"3","key":"38_CR12","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Fredrickson, N., Lynch, N.: Electing a Leader in a Synchronous Ring. J. ACM (January 1987)","DOI":"10.1145\/7531.7919"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11561927_7","volume-title":"Distributed Computing","author":"E. Gafni","year":"2005","unstructured":"Gafni, E., Rajsbaum, S.: Musical Benches. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 63\u201377. Springer, Heidelberg (2005)"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11864219_23","volume-title":"Distributed Computing","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, S., Herlihy, M.: Subconsensus Tasks: Renaming is Weaker than Set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 329\u2013338. Springer, Heidelberg (2006)"},{"key":"38_CR16","unstructured":"Gafni E., (in preparation)"},{"key":"38_CR17","unstructured":"Ostrovsky, R.: Private communication to the author"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/11682462_47","volume-title":"LATIN 2006: Theoretical Informatics","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: The Committee Decision Problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 502\u2013514. Springer, Heidelberg (2006)"},{"issue":"1","key":"38_CR19","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on programming Languages and Systems\u00a011(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on programming Languages and Systems"},{"issue":"6","key":"38_CR20","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"},{"issue":"5","key":"38_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11947950_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:05:55Z","timestamp":1558271155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11947950_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681397","9783540681403"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11947950_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}