{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:11:38Z","timestamp":1787501498015,"version":"3.56.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0890-5401(91)90069-e","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"259-273","source":"Crossref","is-referenced-by-count":5,"title":["Parallel random access machines with bounded memory wordsize"],"prefix":"10.1016","volume":"91","author":[{"given":"Stephen J.","family":"Bellantoni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90069-E_BIB1","series-title":"Proc. 1st Annual ACM Symposium on Parallel Algorithms and Architectures","article-title":"On communication latency in PRAM computations","author":"Aggarwal","year":"1989"},{"key":"10.1016\/0890-5401(91)90069-E_BIB2","series-title":"Proc. 18th ACM Symposium on Theory of Computing","first-page":"169","article-title":"Limits on the power of concurrent-write parallel machines","author":"Beame","year":"1986"},{"key":"10.1016\/0890-5401(91)90069-E_BIB3","series-title":"Proc. 19th Annual ACM Symposium on Theory of Computing","first-page":"83","article-title":"Optimal bounds for decision problems on the CRCW PRAM","author":"Beame","year":"1987"},{"key":"10.1016\/0890-5401(91)90069-E_BIB4","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\/0890-5401(91)90069-E_BIB5","series-title":"Proc. 15th ACM Symposium on Theory of Computing","first-page":"52","article-title":"Unbounded fan-in circuits and associative functions","author":"Chandra","year":"1983"},{"key":"10.1016\/0890-5401(91)90069-E_BIB6","first-page":"1","article-title":"Lower bounds for parallel random access machines with unbounded shared memory","volume":"4","author":"Fich","year":"1987","journal-title":"Adv. Comput. Res."},{"key":"10.1016\/0890-5401(91)90069-E_BIB7","series-title":"Proc. 17th ACM Symposium on Theory of Computing","first-page":"48","article-title":"One, two, three\u2026 infinity: Lower bounds for parallel computation","author":"Fich","year":"1985"},{"key":"10.1016\/0890-5401(91)90069-E_BIB8","series-title":"Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing","first-page":"179","article-title":"Relations between concurrent-write models of parallel computation","author":"Fich","year":"1984"},{"key":"10.1016\/0890-5401(91)90069-E_BIB9","series-title":"Proc. 18th ACM Symposium on Theory of Computing","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/0890-5401(91)90069-E_BIB10","series-title":"Are bit serial or word parallel computers faster?","author":"Ho","year":"1989"},{"key":"10.1016\/0890-5401(91)90069-E_BIB11","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":"Kucera","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90069-E_BIB12","first-page":"2","article-title":"A fast parallel algorithm for routing on a permutation network","volume":"30","author":"Lev","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0890-5401(91)90069-E_BIB13","series-title":"Proc. 18th ACM Symposium on Theory of Computing","first-page":"177","article-title":"New lower bounds for parallel computation","author":"Li","year":"1986"},{"key":"10.1016\/0890-5401(91)90069-E_BIB14","series-title":"Proc. 25th IEEE Symposium on Foundations of Computer Science","first-page":"56","article-title":"On the limits to speed up parallel machines by large hardware and unbounde communication","author":"Meyer auf der Heide","year":"1984"},{"key":"10.1016\/0890-5401(91)90069-E_BIB15","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."},{"key":"10.1016\/0890-5401(91)90069-E_BIB16","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190069E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190069E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:42Z","timestamp":1548879942000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190069E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["089054019190069E"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90069-e","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}