{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:07:33Z","timestamp":1743095253321,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_18","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T22:44:15Z","timestamp":1253659455000},"page":"172-173","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms"],"prefix":"10.1007","author":[{"given":"Michiko","family":"Inoue","sequence":"first","affiliation":[]},{"given":"Tsuyoshi","family":"Suzuki","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Fujiwara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01784242","volume":"9","author":"J. Yang","year":"1995","unstructured":"Yang, J., Anderson, J.: A fast, scalable mutual exclusion algorithm. Distributed Computing\u00a09(1), 51\u201360 (1995)","journal-title":"Distributed Computing"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hendler, D., Woelfel, P.: Tight RMR lower bounds for mutual exclusion and other problems. In: Proceedings of the Fourtieth Annual ACM Symposium on Theory of Computing, pp. 217\u2013226 (2008)","DOI":"10.1145\/1374376.1374410"},{"key":"18_CR3","first-page":"91","volume-title":"Proceedings of the Ninth Annual ACM Symposium on Theory of Computing","author":"G. Peterson","year":"1977","unstructured":"Peterson, G., Fischer, M.: Economical solutions for the critical section problem in a distributed system. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, pp. 91\u201397. ACM, New York (1977)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:44:02Z","timestamp":1558539842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}