{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T12:40:04Z","timestamp":1746189604064,"version":"3.40.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,1,16]],"date-time":"2014-01-16T00:00:00Z","timestamp":1389830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00446-014-0207-6","type":"journal-article","created":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T12:28:55Z","timestamp":1389788935000},"page":"165-179","source":"Crossref","is-referenced-by-count":0,"title":["Tight space bounds for $$\\ell $$ \u2113 -exclusion"],"prefix":"10.1007","volume":"27","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,16]]},"reference":[{"issue":"3","key":"207_CR1","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1145\/177492.177731","volume":"16","author":"Y Afek","year":"1994","unstructured":"Afek, Y., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: A bounded first-in, first-enabled solution to the $$\\ell $$ \u2113 -exclusion problem. ACM Trans. Program. Lang. Syst. 16(3), 939\u2013953 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"207_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 262\u2013272 (1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"key":"207_CR3","unstructured":"Anderson, J.H., Moir, M.: Using local-spin k-exclusion algorithms to improve wait-free object implementations. Distrib. Comput. 11, 1\u201320 (1997)"},{"key":"207_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., Reischuk, R.: Achievable cases in an asynchronous environment. In: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 337\u2013346 (1987)","DOI":"10.1109\/SFCS.1987.5"},{"issue":"1","key":"207_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90014-S","volume":"95","author":"A Bar-Noy","year":"1991","unstructured":"Bar-Noy, A., Dolev, D., Koller, D., Peleg, D.: Fault-tolerant critical section management in asynchronous environments. Inf. Comput. 95(1), 1\u201320 (1991)","journal-title":"Inf. Comput."},{"issue":"2","key":"207_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/990524.990527","volume":"10","author":"JE Burns","year":"1978","unstructured":"Burns, J.E.: Mutual exclusion with linear waiting using binary shared variables. SIGACT News 10(2), 42\u201347 (1978)","journal-title":"SIGACT News"},{"key":"207_CR7","unstructured":"Burns, J.E., Lynch, A.N.: Mutual exclusion using indivisible reads and writes. In: 18th Annual Allerton conference on communication, control and computing, pp. 833\u2013842 (1980)"},{"key":"207_CR8","doi-asserted-by":"crossref","unstructured":"Burns, J.E., Peterson, G.L.: The ambiguity of choosing. In: Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pp. 145\u2013158 (1989)","DOI":"10.1145\/72981.72991"},{"issue":"2","key":"207_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"JN Burns","year":"1993","unstructured":"Burns, J.N., Lynch, N.A.: Bounds on shared-memory for mutual exclusion. Inf. Comput. 107(2), 171\u2013184 (1993)","journal-title":"Inf. Comput."},{"issue":"9","key":"207_CR10","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"EW Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)","journal-title":"Commun. ACM"},{"key":"207_CR11","doi-asserted-by":"crossref","unstructured":"Dolev, D., Gafni, E., Shavit, N.: Toward a non-atomic era: $$\\ell $$ \u2113 -exclusion as a test case. In: Proceedings of the 20th ACM Symposium on Theory of Computing, pp. 78\u201392 (1988)","DOI":"10.1145\/62212.62220"},{"key":"207_CR12","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, M.J., Burns, J.E., Borodin, A.: Resource allocation with immunity to limited process failure. In: Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pp. 234\u2013254 (1979)","DOI":"10.1109\/SFCS.1979.37"},{"issue":"1","key":"207_CR13","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/59287.59292","volume":"11","author":"MJ Fischer","year":"1989","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Distributed FIFO allocation of identical resources using small shared space. ACM Trans. Program. Lang. Syst. 11(1), 90\u2013114 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"207_CR14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"207_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication, Parts I and II. Distrib. Comput. 1(2), 77\u2013101 (1986)","journal-title":"Distrib. Comput."},{"key":"207_CR16","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: Part II\u2014statement and solutions. J. ACM 33, 327\u2013348 (1986)","journal-title":"J. ACM"},{"key":"207_CR17","unstructured":"Loui, M.C., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163\u2013183 (1987)"},{"key":"207_CR18","unstructured":"Peterson, G.L.: New Bounds on Mutual Exclusion Problems. Technical Report TR68, University of Rochester, 1980 (Corrected 1994)"},{"key":"207_CR19","unstructured":"Peterson, G.L.: Observations on $$\\ell $$ \u2113 -exclusion. In: 28th Annual Allerton conference on communication, control and computing, pp. 568\u2013577 (1990)"},{"key":"207_CR20","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming. Pearson\/Prentice-Hall. ISBN 0-131-97259-6 (2006)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0207-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0207-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0207-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T14:50:47Z","timestamp":1746111047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0207-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,16]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0207-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2014,1,16]]}}}