{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:05:03Z","timestamp":1649117103005},"reference-count":5,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":[[1992,6]]},"DOI":"10.1016\/0020-0190(92)90242-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"217-222","source":"Crossref","is-referenced-by-count":1,"title":["PRAMs with variable word-size"],"prefix":"10.1016","volume":"42","author":[{"given":"Ramachandran","family":"Vaidyanathan","sequence":"first","affiliation":[]},{"given":"Carlos R.P.","family":"Hartmann","sequence":"additional","affiliation":[]},{"given":"Pramod K.","family":"Varshney","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90242-N_BIB1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0890-5401(91)90069-E","article-title":"Parallel random access machines with bounded memory wordsize","volume":"91","author":"Bellantoni","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90242-N_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90242-N_BIB3","series-title":"Handbook of Theoretical Computer Science, Vol A: Algorithms and Complexity","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","author":"Karp","year":"1990"},{"key":"10.1016\/0020-0190(92)90242-N_BIB4","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/65950.65959","article-title":"New lower bounds for parallel computation","volume":"36","author":"Li","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90242-N_BIB5","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0214051","article-title":"On parallel searching","volume":"14","author":"Snir","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290242N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290242N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:32Z","timestamp":1555129652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290242N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["002001909290242N"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90242-n","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}