{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T22:52:25Z","timestamp":1762296745067},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,8,1]],"date-time":"1982-08-01T00:00:00Z","timestamp":397008000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11308,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1982,8]]},"DOI":"10.1016\/0022-0000(82)90010-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"66-75","source":"Crossref","is-referenced-by-count":37,"title":["N-Process mutual exclusion with bounded waiting by 4 \u00b7 Log2 N-valued shared variable"],"prefix":"10.1016","volume":"25","author":[{"given":"Michael O.","family":"Rabin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90010-1_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322290.322302","article-title":"Data requirements for implementation of N-process mutual exclusion using a single shared variable","volume":"29","author":"Burns","year":"1982","journal-title":"J. Assoc. Compul. Mach."},{"key":"10.1016\/0022-0000(82)90010-1_BIB2","article-title":"Mutual Exclusion of N Processors Using O(N)-Valued Message Variable","author":"Cremers","year":"1977"},{"key":"10.1016\/0022-0000(82)90010-1_BIB3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/355592.365595","article-title":"Solution of a problem in concurrent programming control","volume":"9","author":"Dijkstra","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(82)90010-1_BIB4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/355592.365595","article-title":"Additional comments on a problem in concurrent control","volume":"9","author":"Knuth","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(82)90010-1_BIB5","series-title":"ACM 8th Annual POPL Symposium","first-page":"133","article-title":"On the advantages of free choice: A symmetric and fully distributed solution to the Dining Philosophers Problem","author":"Lehmann","year":"1981"},{"key":"10.1016\/0022-0000(82)90010-1_BIB6","article-title":"The Choice Coordination Problem","author":"Rabin","year":"1980"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900101?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900101?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:12Z","timestamp":1550325012000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,8]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,8]]}},"alternative-id":["0022000082900101"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90010-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,8]]}}}