{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:57:48Z","timestamp":1757541468965},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0167-8191(90)90040-g","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"165-177","source":"Crossref","is-referenced-by-count":10,"title":["Parallel merging: algorithm and implementation results"],"prefix":"10.1016","volume":"15","author":[{"given":"Peter J","family":"Varman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balakrishna R","family":"Iyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald J","family":"Haderle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen M","family":"Dunn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90040-G_BIB1","series-title":"Notes and Reports in Computer Science and Applied Mathematics","article-title":"Parallel sorting algorithms","author":"Akl","year":"1985"},{"key":"10.1016\/0167-8191(90)90040-G_BIB2","series-title":"Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"issue":"11","key":"10.1016\/0167-8191(90)90040-G_BIB3","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TC.1987.5009478","article-title":"Optimal parallel merging and sorting without memory conflicts","volume":"C-36","author":"Akl","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90040-G_BIB4","series-title":"1986 Conf. Info. Sciences and Systems","first-page":"336","article-title":"Bitonic sorting with O (N log N) comparisons","author":"Bilardi","year":"1986"},{"issue":"3","key":"10.1016\/0167-8191(90)90040-G_BIB5","first-page":"278","article-title":"A taxonomy of parallel sorting","volume":"13","author":"Bitton","year":"1986","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0167-8191(90)90040-G_BIB6","series-title":"Proc. Third Internat. Conf. Su[ercomputing","first-page":"513","article-title":"Optimal parallel algorithms for merging and sorting","author":"Deo","year":"1988"},{"issue":"12","key":"10.1016\/0167-8191(90)90040-G_BIB7","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1109\/12.9738","article-title":"A benchmark parallel sort for shared memory multiprocessors","volume":"C-37","author":"Frances","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90040-G_BIB8","series-title":"Proc. 15th Internat. VLDB Conf.","first-page":"135","article-title":"Percentile finding algorithm for multiple sorted runs","author":"Iyer","year":"1989"},{"key":"10.1016\/0167-8191(90)90040-G_BIB9","first-page":"295","article-title":"Parallel sorting algorithms","volume":"Vol. 23","author":"Lakshmivarahan","year":"1984"},{"key":"10.1016\/0167-8191(90)90040-G_BIB10","series-title":"Designing Efficient Algorithms for Parallel Computers","author":"Quinn","year":"1987"},{"key":"10.1016\/0167-8191(90)90040-G_BIB11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0167-8191(88)90075-0","article-title":"Parallel sorting algorithms for tightly coupled multiprocessors","volume":"6","author":"Quinn","year":"1988","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(90)90040-G_BIB12","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0022-0000(82)90045-9","article-title":"Finding the median distributively","volume":"24","author":"Rodeh","year":"1982","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0167-8191(90)90040-G_BIB13","series-title":"Algorithms","author":"Sedgwick","year":"1988"},{"key":"10.1016\/0167-8191(90)90040-G_BIB14","series-title":"Sequent Guide to Parallel Programming","year":"1987"},{"key":"10.1016\/0167-8191(90)90040-G_BIB15","series-title":"Proc. 1989 Internat. Conf. Parallel Processing","first-page":"202","article-title":"Sorting with linear speedup on a VLSI processor network","author":"Varman","year":"1988"},{"key":"10.1016\/0167-8191(90)90040-G_BIB16_1","series-title":"IBM Internal Report","article-title":"Parallel merge of sorted runs using an arbitrary number of processors","author":"Varman","year":"1988"},{"key":"10.1016\/0167-8191(90)90040-G_BIB16_2","author":"Varman","year":"1988","journal-title":"IBM Research Report, RJ6632"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090040G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090040G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:26:09Z","timestamp":1551086769000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090040G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["016781919090040G"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90040-g","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}