{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:47:53Z","timestamp":1648871273172},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"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":[[1981,12]]},"DOI":"10.1016\/0020-0190(81)90119-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"103-106","source":"Crossref","is-referenced-by-count":4,"title":["A parallel merging algorithm"],"prefix":"10.1016","volume":"13","author":[{"given":"R.H.","family":"Barlow","sequence":"first","affiliation":[]},{"given":"D.J.","family":"Evans","sequence":"additional","affiliation":[]},{"given":"J.","family":"Shanehchi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(81)90119-8_BIB1","unstructured":"R.H. Barlow, D.J. Evans, I.A. Newman, and M.C. Woodward, The NEPTUNE parallel processing system, Computer Studies Rep., Loughborough University."},{"key":"10.1016\/0020-0190(81)90119-8_BIB2","first-page":"307","article-title":"Sorting networks on their applications","volume":"32","author":"Batcher","year":"1968","journal-title":"Proc. AFIPS Spring Joint Computer Conf."},{"key":"10.1016\/0020-0190(81)90119-8_BIB3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/360238.360243","article-title":"Interference in multiprocessor computer systems with interleaved memory","volume":"19","author":"Baskett","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(81)90119-8_BIB4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TC.1978.1674957","article-title":"Optimal sorting algorithms for parallel computers","volume":"27","author":"Baudet","year":"1978","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/0020-0190(81)90119-8_BIB5","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/361020.361216","article-title":"Merging with parallel processors","volume":"18","author":"Gavrill","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(81)90119-8_BIB6","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(81)90119-8_BIB7","first-page":"314","article-title":"Finding the maximum merging and sorting in a parallel computational model, CONPAR 81","volume":"Vol. 111","author":"Shiloach","year":"1981"},{"key":"10.1016\/0020-0190(81)90119-8_BIB8","unstructured":"N.Y. Yousif, private communication."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081901198?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081901198?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:19Z","timestamp":1555087999000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019081901198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["0020019081901198"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(81)90119-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}