{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:46:51Z","timestamp":1740894411155,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201847"},{"type":"electronic","value":"9783540399896"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/978-3-540-39989-6_2","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T02:01:57Z","timestamp":1294452117000},"page":"16-29","source":"Crossref","is-referenced-by-count":6,"title":["Uniform Solvability with a Finite Number of MWMR Registers"],"prefix":"10.1007","author":[{"given":"Marcos K.","family":"Aguilera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Englert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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 20th Annual ACM Symp. on Principles of Distributed Computing, pp. 81\u201389 (2000)","DOI":"10.1145\/343477.343523"},{"key":"2_CR2","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 (1999)","DOI":"10.1145\/301308.301335"},{"key":"2_CR3","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 (1999)"},{"key":"2_CR4","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 (1995)","DOI":"10.1145\/225058.225271"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M.: Fast, wait-free (2fc \u2013 1)-renaming. In: Proc. of the 18th Ann. ACM Symp. on Principles of Distributed Computing, pp. 105\u2013112 (1999)","DOI":"10.1145\/301308.301338"},{"key":"2_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 (1997)","DOI":"10.1145\/259380.259431"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long lived adaptive collect with applications. In: Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, pp. 262\u2013272 (1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"key":"2_CR8","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long lived adaptive splitter and applications (1999) (unpublished manuscript )"},{"key":"2_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":"2_CR10","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Englert, B., Gafni, E.: On using network attached disks as shared memory. In: Proc.of the 22nd Ann. ACM Symp. on Principles of Distributed Computing (2003) (to appear)","DOI":"10.1145\/872035.872082"},{"key":"2_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)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings ofthe 12th ACM Symposium on Theory ofComputing, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"2_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 (2002)","DOI":"10.1145\/509907.509983"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Waarts, O.: Modular competitiveness for distributed algorithms. In: Proc. 28th ACM Symp. Theory of Comp., pp. 237\u2013246 (1996)","DOI":"10.1145\/237814.237869"},{"key":"2_CR15","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, pp. 91\u2013100 (2000)","DOI":"10.1145\/343477.343525"},{"key":"2_CR16","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 (1996)","DOI":"10.1145\/248052.248097"},{"key":"2_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 (1998)","DOI":"10.1145\/277697.277749"},{"key":"2_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"},{"key":"2_CR19","unstructured":"Attiya, H., Fouren, A.: Algorithms adaptive to point contention. JACM (2001) (submitted for publication)"},{"issue":"2","key":"2_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"},{"issue":"2","key":"2_CR21","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":"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"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Fich, F., Ruppert, E.: Space-optimal multi-writer snapshot objects are slow. In: Proc. 21st Annual ACM Symp. on Principles of Distributed Computing, pp. 13\u201320 (2002)","DOI":"10.1145\/571825.571828"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Fich, F., Ruppert, E.: A tight lower bound for space-optimal implementations of multi-writer snapshots. In: Proc. 35th Annual ACM Symp. on Theory of Computing, pp. 259\u2013268 (2003)","DOI":"10.1145\/780542.780582"},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F. Fich","year":"1998","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. JACM\u00a045(5), 843\u2013862 (1998)","journal-title":"JACM"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Gafni, E.: A simple algorithmic characterization of uniform solvability. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 228\u2013237 (2002)","DOI":"10.1109\/SFCS.2002.1181946"},{"issue":"6","key":"2_CR27","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. JACM\u00a046(6), 858\u2013923 (1999)","journal-title":"JACM"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Inoue, M., Umetani, S., Masuzawa, T., Fujiwara, H.: Adaptive long-lived O(k 2 ) renaming with O(k2) steps. In: Proceedings of the 15th International Conference on Distributed Computing, pp. 123\u2013135 (2001)","DOI":"10.1007\/3-540-45414-4_9"},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0890-5401(90)90004-2","volume":"88","author":"A. Itai","year":"1990","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Information and Computation\u00a088(1), 60\u201387 (1990)","journal-title":"Information and Computation"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Joung, Y.-J.: Asynchronous group mutual exclusion (extended abstract). In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 51\u201360 (1998)","DOI":"10.1145\/277697.277706"},{"issue":"1","key":"2_CR31","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":"2_CR32","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":"2_CR33","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":"2_CR34","unstructured":"Peterson, G.L.: Time efficient adaptive mutual exclusion algorithms (2001) (unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39989-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:49:47Z","timestamp":1740840587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39989-6_2"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201847","9783540399896"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39989-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}