{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:33:23Z","timestamp":1725478403083},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540363217"},{"type":"electronic","value":"9783540363224"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","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\/11795490_5","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T07:25:18Z","timestamp":1169537118000},"page":"32-46","source":"Crossref","is-referenced-by-count":1,"title":["Can Memory Be Used Adaptively by Uniform Algorithms?"],"prefix":"10.1007","author":[{"given":"Burkhard","family":"Englert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darin","family":"Goldstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-Lived Renaming made adaptive. In: Proc. of 18th Annual ACM Symp. on Principles of Distributed Computing, pp. 91\u2013103 (May 1999)","DOI":"10.1145\/301308.301335"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Boxer, P., Touitou, D.: Bounds on the shared memory requirements for long-lived and adaptive objects. In: Proc. of the 19th Ann. ACM Symp. on Principles of Distributed Computing (PODC 2000), pp. 81\u201389 (July 2000)","DOI":"10.1145\/343477.343523"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proc. of the 27th Ann. ACM Symp. on Theory of Computing, pp. 538\u2013547 (May 1995)","DOI":"10.1145\/225058.225271"},{"key":"5_CR4","unstructured":"Afek, Y., Attiya, H., Stupp, G., Touitou, D.: Adaptive long-lived renaming using bounded memory. In: Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, pp. 262\u2013272 (October 1999)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M.: Fast, wait-free (2k\u2009\u2212\u20091)-renaming. In: Proc. of the 18th Ann. ACM Symp. on Principles of Distributed Computing, pp. 105\u2013112 (May 1999)","DOI":"10.1145\/301308.301338"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M., Taubenfeld, G., Touitou, D.: Disentangling multi-object operations. In: Proc. of 16th Annual ACM Symp. on Principles of Distributed Computing, pp. 111\u2013120 (August 1997)","DOI":"10.1145\/259380.259431"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proc. of the 40th Ann. Symp. on Foundations of Computer Science, pp. 262\u2013272 (October 1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"issue":"2","key":"5_CR8","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"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long lived and adaptive atomic snapshot and immediate snapshot. In: Proc. of the 19th Ann. ACM Symp. on Principles of Distributed Computing, pp. 71\u201380 (2000)","DOI":"10.1145\/343477.343521"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-39989-6_2","volume-title":"Distributed Computing","author":"M. Aguilera","year":"2003","unstructured":"Aguilera, M., Englert, B., Gafni, E.: Uniform Solvability with a finite number of MWMR registers. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 16\u201329. Springer, Heidelberg (2003)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-40026-5_2","volume-title":"Distributed Computing","author":"J. Anderson","year":"2000","unstructured":"Anderson, J., Kim, Y.-J.: Adaptive mutual exclusion with local spinning. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 29\u201343. Springer, Heidelberg (2000)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1006\/inco.1996.0006","volume":"124","author":"J. Anderson","year":"1996","unstructured":"Anderson, J., Yang, J.-H.: Time\/contention trade-offs for multiprocessor synchronization. Information and Computation\u00a0124(1), 68\u201384 (1996)","journal-title":"Information and Computation"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Shah, G., Shah, J.: Wait free consensus with infinite arrivals. In: Proc. of the 34th Annual ACM Symposium on the Theory of Computing, pp. 524\u2013533 (May 2002)","DOI":"10.1145\/509907.509983"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 91\u2013100 (2000)","DOI":"10.1145\/343477.343525"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Attiya, H., Dagan, E.: Universal operations: Unary versus binary. In: Proc. 15th Annual ACM Symp. on Principles of Distributed Computing, pp. 223\u2013232 (May 1996)","DOI":"10.1145\/248052.248097"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fich, F., Kaplan, Y.: Lower bounds for adaptive collect and related objects. In: Proc. 23 Annual ACM Symp. on Principles of Distributed Computing, pp. 60\u201370 (July 2004)","DOI":"10.1145\/1011767.1011777"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fouren, A.: Adaptive wait-free algorithms for lattice agreement and renaming. In: Proc. 17th Annual ACM Symp. on Principles of Distributed Computing, pp. 277\u2013286 (June 1998)","DOI":"10.1145\/277697.277749"},{"key":"5_CR18","unstructured":"Attiya, H., Fouren, A.: Adaptive long-lived renaming with read and write operations. Technical Report 0956, Faculty of Computer Science, Technion, Haifa (1999), http:\/\/www.cs.technion.ac.il\/hagit\/pubs\/tr0956.ps.gz"},{"issue":"4","key":"5_CR19","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. J. ACM\u00a050(4), 444\u2013468 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"5_CR20","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":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-30186-8_12","volume-title":"Distributed Computing","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Kuhn, F., Wattenhofer, M., Wattenhofer, R.: Efficient Adaptive Collect using Randomization. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 159\u2013173. Springer, Heidelberg (2004)"},{"key":"5_CR22","unstructured":"Attiya, H., Zach, I.: Fully adaptive algorithms for atomic and immediate snapshots (2003), www.cs.technion.ac.il\/hagit\/pubs\/AZ03.pdf"},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J. Burns","year":"1993","unstructured":"Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Information and Computation\u00a0107(2), 171\u2013184 (1993)","journal-title":"Information and Computation"},{"issue":"1","key":"5_CR24","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"},{"key":"5_CR25","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":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Transactions on Computer Systems"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0020-0190(93)90015-2","volume":"45","author":"M. Merritt","year":"1993","unstructured":"Merritt, M., Taubenfeld, G.: Speeding Lamport\u2019s fast mutual exclusion algorithm. Information Processing Letters\u00a045, 137\u2013142 (1993)","journal-title":"Information Processing Letters"},{"issue":"1","key":"5_CR28","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. Sci. Comput. Programming\u00a025(1), 1\u201339 (1995)","journal-title":"Sci. Comput. Programming"},{"key":"5_CR29","unstructured":"Peterson, G.L.: Time efficient adaptive mutual exclusion algorithms (unpublished manuscript, 2001)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:59:59Z","timestamp":1556045999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11795490_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}