{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T01:18:52Z","timestamp":1648516732404},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0020-0190(97)00102-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"165-166","source":"Crossref","is-referenced-by-count":0,"title":["Computing OR on a randomized fixed adversary CRCW PRAM"],"prefix":"10.1016","volume":"63","author":[{"given":"Lud\u011bk","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00102-6_BIB1","doi-asserted-by":"crossref","unstructured":"F.E. Fich, R. Impagliazzo, B. Kapron, V. King and M. Kutylowski, Limits on the power of parallel random access machines with weak forms of write conflict resolution, in: P. Enjalbert, A. Finkel and K.W. Wagner, eds., STACS 93, Lecture Notes in Computer Science, Vol. 665 (Springer, Berlin) 386\u2013397.","DOI":"10.1007\/3-540-56503-5_39"},{"key":"10.1016\/S0020-0190(97)00102-6_BIB2","series-title":"Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures","first-page":"117","article-title":"Every Robust CRCW PRAM can efficiently simulate a Priority PRAM","author":"Hagerup","year":"1990"},{"key":"10.1016\/S0020-0190(97)00102-6_BIB3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","article-title":"Parallel computation and conflicts in memory access","volume":"14","author":"Ku\u010dera","year":"1982","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:26:13Z","timestamp":1556043973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0020019097001026"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00102-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}