{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:56Z","timestamp":1725488096494},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426059"},{"type":"electronic","value":"9783540454144"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45414-4_1","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T19:12:40Z","timestamp":1184958760000},"page":"1-15","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Time Complexity Bound for Adaptive Mutual Exclusion"],"prefix":"10.1007","author":[{"given":"Yong-Jik","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H.","family":"Anderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 91\u2013103. May 1999.","DOI":"10.1145\/301308.301335"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Y. Afek, P. Boxer, and D. Touitou. Bounds on the shared memory requirements for long-lived and adaptive objects. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 81\u201389. July 2000.","DOI":"10.1145\/343477.343523"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning. In Proceedings of the 14th International Symposium on Distributed Computing, pages 29\u201343, October 2000.","DOI":"10.1007\/3-540-40026-5_2"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"J. Anderson and Y.-J. Kim. An improved lower bound for the time complexity of mutual exclusion. To be presented at the 20th Annual ACM Symposium on Principles of Distributed Computing, August 2001.","DOI":"10.1145\/383962.383996"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1006\/inco.1996.0006","volume":"124","author":"J. Anderson","year":"1996","unstructured":"J. Anderson and J.-H. Yang. Time\/contention tradeoffs for multiprocessor synchronization. Information and Computation, 124(1):68\u201384, January 1996.","journal-title":"Information and Computation"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"H. Attiya and V. Bortnikov. Adaptive and efficient mutual exclusion. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 91\u2013100. July 2000.","DOI":"10.1145\/343477.343525"},{"key":"1_CR7","unstructured":"J. Burns and N. Lynch. Mutual exclusion using indivisible reads and writes. In Proceedings of the 18th Annual Allerton Conference on Communication,Control, and Computing, pages 833\u2013842, 1980."},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02283567","volume":"8","author":"M. Choy","year":"1994","unstructured":"M. Choy and A. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1):1\u201317, 1994.","journal-title":"Distributed Computing"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1\u201311, February 1987.","journal-title":"ACM Transactions on Computer Systems"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0020-0190(93)90015-2","volume":"45","author":"M. Merritt","year":"1993","unstructured":"M. Merritt and G. Taubenfeld. Speeding Lamport\u2019s fast mutual exclusion algorithm. Information Processing Letters, 45:137\u2013142, 1993.","journal-title":"Information Processing Letters"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"E. Styer. Improving fast mutual exclusion. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 159\u2013168. August 1992.","DOI":"10.1145\/135419.135453"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"E. Styer and G. Peterson. Tight bounds for shared memory symmetric mutual exclusion. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 177\u2013191. August 1989.","DOI":"10.1145\/72981.72993"},{"key":"1_CR13","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"P. Tur\u00e1n. On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok, 48:436\u2013452, 1941.","journal-title":"Mat. Fiz. Lapok"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01784242","volume":"9","author":"J.-H. Yang","year":"1995","unstructured":"J.-H. Yang and J. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9(1):51\u201360, August 1995.","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45414-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T17:20:36Z","timestamp":1578504036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45414-4_1"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426059","9783540454144"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45414-4_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"11 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}