{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:44:02Z","timestamp":1764305042983},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,4,1]],"date-time":"1982-04-01T00:00:00Z","timestamp":386467200000},"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":[[1982,4]]},"DOI":"10.1016\/0020-0190(82)90093-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"93-96","source":"Crossref","is-referenced-by-count":105,"title":["Parallel computation and conflicts in memory access"],"prefix":"10.1016","volume":"14","author":[{"given":"Lud\u011bk","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90093-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(82)90093-X_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/800133.804339","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978","journal-title":"Proc. 10th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(82)90093-X_BIB3","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/322047.322057","article-title":"Some complexity results for matrix computations on parallel processors","volume":"25","author":"Gentleman","year":"1978","journal-title":"J. ACH"},{"key":"10.1016\/0020-0190(82)90093-X_BIB4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/800113.803631","article-title":"Parallel algorithms for the transitive closure and the connected components problems","author":"Hirschberg","year":"1976","journal-title":"Proc. 8th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(82)90093-X_BIB5","series-title":"TR CS 78-05","article-title":"Graph connectivity problems on parallel computers","author":"Ja' Ja'","year":"1978"},{"key":"10.1016\/0020-0190(82)90093-X_BIB6","series-title":"TR CS 80-14","article-title":"Parallel algorithms in graph theory: planarity testing","author":"Ja' Ja'","year":"1980"},{"key":"10.1016\/0020-0190(82)90093-X_BIB7","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. AMS"},{"key":"10.1016\/0020-0190(82)90093-X_BIB8","article-title":"Parallelism in sorting","author":"Preparata","year":"1977","journal-title":"International Conf. on Parallel Processing, Belair, Michigan"},{"key":"10.1016\/0020-0190(82)90093-X_BIB9","series-title":"Tech. Rep. No. 173","article-title":"Finding the maximum merging and sorting in a parallel computation model","author":"Shiloach","year":"1980"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908290093X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908290093X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:53:50Z","timestamp":1555088030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908290093X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["002001908290093X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90093-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,4]]}}}