{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:12:50Z","timestamp":1743156770212,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877783"},{"type":"electronic","value":"9783540877790"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87779-0_7","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T05:17:14Z","timestamp":1222060634000},"page":"93-108","source":"Crossref","is-referenced-by-count":9,"title":["Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion"],"prefix":"10.1007","author":[{"given":"Robert","family":"Danek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Golab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"7_CR1","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E. Dijkstra","year":"1965","unstructured":"Dijkstra, E.: Solution of a problem in concurrent programming control. Communications of the ACM\u00a08(9), 569 (1965)","journal-title":"Communications of the ACM"},{"issue":"8","key":"7_CR2","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L.: A new solution to Dijkstra\u2019s concurrent programming problem. Communications of the ACM\u00a017(8), 453\u2013455 (1974)","journal-title":"Communications of the ACM"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J. Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J., Scott, M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems\u00a09(1), 21\u201365 (1991)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T. Anderson","year":"1990","unstructured":"Anderson, T.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems\u00a01(1), 6\u201316 (1990)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45414-4_1","volume-title":"Distributed Computing","author":"Y.-J. Kim","year":"2001","unstructured":"Kim, Y.-J., Anderson, J.: A time complexity bound for adaptive mutual exclusion. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 1\u201315. Springer, Heidelberg (2001)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hendler, D., Woelfel, P.: Tight RMR lower bounds for mutual exclusion and other problems. In: Proc. STOC 2008, pp. 217\u2013226 (2008)","DOI":"10.1145\/1374376.1374410"},{"key":"7_CR7","first-page":"3","volume-title":"Proc. PODC 2007","author":"W. Golab","year":"2007","unstructured":"Golab, W., Hadzilacos, V., Hendler, D., Woelfel, P.: Constant-RMR implementations of cas and other synchronization primitives using read and write operations. In: Proc. PODC 2007, pp. 3\u201312. ACM, New York (2007)"},{"issue":"1","key":"7_CR8","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 Trans. Comput. Syst\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Trans. Comput. Syst"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/135419.135453","volume-title":"PODC 1992: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing","author":"E. Styer","year":"1992","unstructured":"Styer, E.: Improving fast mutual exclusion. In: PODC 1992: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, pp. 159\u2013168. ACM, New York (1992)"},{"issue":"1","key":"7_CR10","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. Distrib. Comput.\u00a08(1), 1\u201317 (1994)","journal-title":"Distrib. Comput."},{"issue":"3","key":"7_CR11","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. Distrib. Comput.\u00a015(3), 177\u2013189 (2002)","journal-title":"Distrib. Comput."},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01784242","volume":"9","author":"J.H. Yang","year":"1995","unstructured":"Yang, J.H., Anderson, J.H.: A fast, scalable mutual exclusion algorithm. Distributed Computing\u00a09(1), 51\u201360 (1995)","journal-title":"Distributed Computing"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00446-006-0009-6","volume":"19","author":"Y.J. Kim","year":"2007","unstructured":"Kim, Y.J., Anderson, J.: Adaptive mutual exclusion with local spinning. Dist. Computing\u00a019(3), 197\u2013236 (2007)","journal-title":"Dist. Computing"},{"issue":"2","key":"7_CR14","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. Distrib. Comput.\u00a015(2), 67\u201386 (2002)","journal-title":"Distrib. Comput."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/215399.215434","volume-title":"SPAA 1995: Proc. of the 7th annual ACM symposium on Parallel algorithms and architectures","author":"R. Cypher","year":"1995","unstructured":"Cypher, R.: The communication requirements of mutual exclusion. In: SPAA 1995: Proc. of the 7th annual ACM symposium on Parallel algorithms and architectures, pp. 147\u2013156. ACM Press, New York (1995)"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-002-0084-2","volume":"15","author":"J. Anderson","year":"2002","unstructured":"Anderson, J., Kim, Y.J.: An improved lower bound for the time complexity of mutual exclusion. Distributed Computing\u00a015(4), 221\u2013253 (2002)","journal-title":"Distributed Computing"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/1146381.1146423","volume-title":"PODC 2006: Proc. of the 25th annual ACM symposium on Principles of distributed computing","author":"R. Fan","year":"2006","unstructured":"Fan, R., Lynch, N.: An \u03a9(n logn) lower bound on the cost of mutual exclusion. In: PODC 2006: Proc. of the 25th annual ACM symposium on Principles of distributed computing, pp. 275\u2013284. ACM Press, New York (2006)"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/571825.571875","volume-title":"PODC 2002: Proceedings of the twenty-first annual symposium on Principles of distributed computing","author":"P. Jayanti","year":"2002","unstructured":"Jayanti, P.: f-arrays: Implementation and applications. In: PODC 2002: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pp. 270\u2013279. ACM, New York (2002)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-30186-8_5","volume-title":"Distributed Computing","author":"G. Taubenfeld","year":"2004","unstructured":"Taubenfeld, G.: The black-white bakery algorithm and related bounded-space, adaptive, local-spinning and fifo algorithms. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 56\u201370. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87779-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T04:08:55Z","timestamp":1714795735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87779-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877783","9783540877790"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87779-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}