{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:13:07Z","timestamp":1725541987927},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108761"},{"type":"electronic","value":"9783642108778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_22","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T07:11:04Z","timestamp":1259737864000},"page":"270-284","source":"Crossref","is-referenced-by-count":4,"title":["On the Computational Power of Shared Objects"],"prefix":"10.1007","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11561927_11","volume-title":"Distributed Computing","author":"H. Attiya","year":"2005","unstructured":"Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with reads and writes in the absence of step contention. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 122\u2013136. Springer, Heidelberg (2005)"},{"issue":"2-3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F.E. Fich","year":"2003","unstructured":"Fich, F.E., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing\u00a016(2-3), 121\u2013163 (2003)","journal-title":"Distributed Computing"},{"issue":"2","key":"22_CR3","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":"22_CR4","doi-asserted-by":"crossref","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proc. 20th ACM Symp. on Principles of Distributed Computing, pp. 161\u2013169 (August 2001)","DOI":"10.1145\/383962.384008"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-free synchronization. ACM Trans. on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"22_CR6","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proc. of the 23rd Int. Conf. on Dist. Computing Systems (2003)"},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. Toplas\u00a012(3), 463\u2013492 (1990)","journal-title":"Toplas"},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1145\/263867.263888","volume":"44","author":"P. Jayanti","year":"1997","unstructured":"Jayanti, P.: Robust wait-free hierarchies. Journal of the ACM\u00a044(4), 592\u2013614 (1997)","journal-title":"Journal of the ACM"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-56188-9_5","volume-title":"Proc. of the 6th Int. Workshop on Distributed Algorithms","author":"P. Jayanti","year":"1992","unstructured":"Jayanti, P., Toueg, S.: Some results on the impossibility, universality, and decidability of consensus. In: Proc. of the 6th Int. Workshop on Distributed Algorithms. LNCS, vol.\u00a0674, pp. 69\u201384. Springer, Heidelberg (1992)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1137\/S0097539798335766","volume":"30","author":"W.-K. Lo","year":"2000","unstructured":"Lo, W.-K., Hadzilacos, V.: All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust. SIAM Journal on Computing\u00a030(3), 689\u2013728 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-540-39989-6_4","volume-title":"Distributed Computing","author":"V. Luchangco","year":"2003","unstructured":"Luchangco, V., Moir, M., Shavit, N.: On the uncontended complexity of consensus. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 45\u201359. Springer, Heidelberg (2003)"},{"key":"22_CR12","first-page":"163","volume":"4","author":"M.C. Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research\u00a04, 163\u2013183 (1987)","journal-title":"Advances in Computing Research"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Distributed Computing","author":"M. Merritt","year":"2003","unstructured":"Merritt, M., Taubenfeld, G.: Resilient consensus for infinitely many processes. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 1\u201315. Springer, Heidelberg (2003)"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Plotkin, S.A.: Sticky bits and universality of consensus. In: Proc. 8th ACM Symp. on Principles of Distributed Computing, pp. 159\u2013175 (1989)","DOI":"10.1145\/72981.72992"},{"key":"22_CR16","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, p. 423. Pearson \/ Prentice-Hall (2006)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-642-04355-0_17","volume-title":"DISC 2009","author":"G. Taubenfeld","year":"2009","unstructured":"Taubenfeld, G.: Contention-sensitive data structures and algorithms. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 157\u2013171. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:43:08Z","timestamp":1619782988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}