{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:38Z","timestamp":1725543818142},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_2","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"10-23","source":"Crossref","is-referenced-by-count":6,"title":["Adapting to Point Contention with Long-Lived Safe Agreement"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","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":"2_CR2","unstructured":"Attiya, H., Zach, I.: Fully adaptive algorithms for atomic and immediate snapshots. www.cs.technion.ac.il\/~hagit\/pubs\/AZ03.pdf (2003)"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/792538.792541","volume":"50","author":"H. Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adaptive to point contention. Journal of the ACM\u00a050(4), 444\u2013468 (2003)","journal-title":"Journal of the ACM"},{"key":"2_CR4","unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Adaptive long-lived renaming using bounded memory (1999), www.cs.technion.ac.il\/~hagit\/pubs\/AAFST99disc.ps.gz"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45414-4_9","volume-title":"Distributed Computing","author":"M. Inoue","year":"2001","unstructured":"Inoue, M., Umetani, S., Masuzawa, T., Fujiwara, H.: Adaptive long-lived O(k 2)-renaming with O(k 2) steps. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 123\u2013135. Springer, Heidelberg (2001)"},{"issue":"3","key":"2_CR6","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. Journal of the ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"Journal of the ACM"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","volume":"25","author":"M. Moir","year":"1995","unstructured":"Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming\u00a025(1), 1\u201339 (1995)","journal-title":"Science of Computer Programming"},{"key":"2_CR8","first-page":"262","volume-title":"Proceedings of the 40th IEEE Symposium on Foundations of Computer Science","author":"Y. Afek","year":"1999","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived and adaptive collect with applications. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, Phoenix, pp. 262\u2013272. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"2_CR9","first-page":"71","volume-title":"Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing","author":"Y. Afek","year":"2000","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived and adaptive atomic snapshot and immediate snapshot. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 71\u201380. ACM Press, New York (2000)"},{"issue":"1","key":"2_CR10","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 Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. Journal of the ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"Journal of the ACM"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1137\/S0097539700366000","volume":"31","author":"H. Attiya","year":"2001","unstructured":"Attiya, H., Fouren, A.: Adaptive and efficient algorithms for lattice agreement and renaming. SIAM Journal on Computing\u00a031(2), 642\u2013664 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR13","unstructured":"Stupp, G.: Long Lived and Adaptive Shared Memory Implementations. PhD thesis, Department of Computer Science, Tel-Aviv University (2001)"},{"key":"2_CR14","first-page":"81","volume-title":"Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing","author":"Y. Afek","year":"2000","unstructured":"Afek, Y., Boxer, P., Touitou, D.: Bounds on the shared memory requirements for long-lived adaptive objects. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 81\u201389. ACM Press, New York (2000)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fich, F., Kaplan, Y.: Lower bounds for adaptive collect and related problems. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 60\u201369 (2004)","DOI":"10.1145\/1011767.1011777"},{"key":"2_CR16","first-page":"538","volume-title":"Proceedings of the 27th ACM Symposium on Theory of Computing","author":"Y. Afek","year":"1995","unstructured":"Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 538\u2013547. ACM Press, New York (1995)"},{"key":"2_CR17","volume-title":"Electronic Notes in Theoretical Computer Science","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Space- and time-adaptive non-blocking algorithms. In: Electronic Notes in Theoretical Computer Science, vol.\u00a078, Elsevier, Amsterdam (2003)"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s004460100060","volume":"15","author":"Y. Afek","year":"2002","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive splitter and applications. Distributed Computing\u00a015(2), 67\u201386 (2002)","journal-title":"Distributed Computing"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s004460100067","volume":"15","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing\u00a015(2), 87\u201396 (2002)","journal-title":"Distributed Computing"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Anderson, J., Kim, Y.J.: Adaptive mutual exclusion with local spinning. In: Proceedings of the 14th International Conference on Distributed Computing (2000)","DOI":"10.1007\/3-540-40026-5_2"},{"issue":"3","key":"2_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s004460100068","volume":"15","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. Distributed Computing\u00a015(3), 177\u2013189 (2002)","journal-title":"Distributed Computing"},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02283567","volume":"8","author":"M. Choy","year":"1994","unstructured":"Choy, M., Singh, A.K.: Adaptive solutions to the mutual exclusion problem. Distributed Computing\u00a08(1), 1\u201317 (1994)","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\/11780823_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:11Z","timestamp":1619507831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11780823_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}