{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:18:11Z","timestamp":1742386691912},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,11,2]],"date-time":"2005-11-02T00:00:00Z","timestamp":1130889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,11,2]],"date-time":"2005-11-02T00:00:00Z","timestamp":1130889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s00446-005-0136-5","type":"journal-article","created":{"date-parts":[[2006,1,16]],"date-time":"2006-01-16T09:54:13Z","timestamp":1137405253000},"page":"267-277","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the inherent weakness of conditional primitives"],"prefix":"10.1007","volume":"18","author":[{"given":"Faith Ellen","family":"Fich","sequence":"first","affiliation":[]},{"given":"Danny","family":"Hendler","sequence":"additional","affiliation":[]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,11,2]]},"reference":[{"issue":"4","key":"136_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-002-0084-2","volume":"15","author":"J.H. Anderson","year":"2002","unstructured":"Anderson, J.H., Kim, Y.J.: An improved lower bound for the time complexity of mutual exclusion. Distrib. Comput. 15(4), 221\u2013253 (2002)","journal-title":"Distrib. Comput."},{"issue":"2\u20133","key":"136_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-003-0088-6","volume":"16","author":"J.H. Anderson","year":"2003","unstructured":"Anderson, J.H., Kim, Y.J., Herman, T.: Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput. 16(2\u20133), 75\u2013110 (2003)","journal-title":"Distrib. Comput."},{"issue":"2","key":"136_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J.E. Burns","year":"1993","unstructured":"Burns, J.E., Lynch, N.A.: Bounds on shared memory for mutual exclusion. Information and Computation 107(2), 171\u2013184 (1993)","journal-title":"Information and Computation"},{"key":"136_CR4","doi-asserted-by":"crossref","unstructured":"Cypher, R.: The communication requirements of mutual exclusion. In: Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 147\u2013156 (1995)","DOI":"10.1145\/215399.215434"},{"issue":"6","key":"136_CR5","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1145\/268999.269000","volume":"44","author":"C. Dwork","year":"1997","unstructured":"Dwork, C., Herlihy, M., Waarts, O.: Contention in shared memory algorithms. J. ACM 44(6), 779\u2013805 (1997)","journal-title":"J. ACM"},{"issue":"2\u20133","key":"136_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F. Fich","year":"2003","unstructured":"Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing.Distrib. Comput. 16(2\u20133), 121\u2013163 (2003)","journal-title":"Distrib. Comput."},{"issue":"1","key":"136_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"136_CR8","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: A time complexity lower bound for randomized implementations of some shared objects. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distrib. Comput., pp. 201\u2013210 (1998)","DOI":"10.1145\/277697.277735"},{"issue":"2","key":"136_CR9","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1137\/S0097539797317299","volume":"30","author":"P. Jayanti","year":"2000","unstructured":"Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for non-blocking implementations. Siam J. Comput. 30(2), 438\u2013456 (2000)","journal-title":"Siam J. Comput."},{"issue":"1","key":"136_CR10","doi-asserted-by":"crossref","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. Distrib. Comput. 9(1), 51\u201360 (1995)","journal-title":"Distrib. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0136-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-005-0136-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0136-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0136-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T04:13:51Z","timestamp":1652501631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-005-0136-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,2]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["136"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0136-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,2]]},"assertion":[{"value":"8 November 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2005","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2005","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}