{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T09:54:10Z","timestamp":1672739650805},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"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":[[1983,11]]},"DOI":"10.1016\/0020-0190(83)90041-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"203-205","source":"Crossref","is-referenced-by-count":7,"title":["A note on the \u2018parallel computation thesis\u2019"],"prefix":"10.1016","volume":"17","author":[{"given":"Norbert","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90041-8_BIB1","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90041-8_BIB2","first-page":"338","article-title":"Routing, merging and sorting on parallel models of computation","author":"Borodin","year":"1982","journal-title":"14th STOC"},{"key":"10.1016\/0020-0190(83)90041-8_BIB3","first-page":"98","article-title":"Alternation","author":"Chandra","year":"1976","journal-title":"Proc. 17th FOCS"},{"key":"10.1016\/0020-0190(83)90041-8_BIB4","first-page":"360","article-title":"Hardware complexity and parallel computation","author":"Dymond","year":"1980","journal-title":"Proc. 21th FOCS"},{"key":"10.1016\/0020-0190(83)90041-8_BIB5","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978","journal-title":"Proc. 10th STOC"},{"key":"10.1016\/0020-0190(83)90041-8_BIB6","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","article-title":"A universal interconnection pattern for parallel computers","volume":"29","author":"Goldschlager","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(83)90041-8_BIB7","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(83)90041-8_BIB8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging and sorting in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900418?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900418?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:56:57Z","timestamp":1555073817000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,11]]}},"alternative-id":["0020019083900418"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90041-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}