{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:43Z","timestamp":1757629483563,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0743-7315(89)90009-9","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"623-635","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Parallel external merging"],"prefix":"10.1016","volume":"6","author":[{"given":"Eliezer","family":"Dekel","sequence":"first","affiliation":[]},{"given":"Istvan","family":"Ozsvath","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0743-7315(89)90009-9_BIB1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TC.1978.1674957","article-title":"Optimal sorting for parallel computers","volume":"C-27","author":"Baudet","year":"1978","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/0743-7315(89)90009-9_BIB2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/TC.1984.1676356","article-title":"External sorting in VLSI","volume":"C-33","author":"Banuccelli","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0743-7315(89)90009-9_BIB3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/2514.2516","article-title":"A taxonomy of parallel sorting","volume":"16","author":"Bitton","year":"1984","journal-title":"Comput. Surveys"},{"issue":"7","key":"10.1016\/0743-7315(89)90009-9_BIB4","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TC.1980.1675626","article-title":"On the complexity of sorting in magnetic bubble memory systems","volume":"C-29","author":"Chung","year":"1980","journal-title":"IEEE Trans. Comput."},{"year":"1984","series-title":"Parallel sort with few processors. Program in computer science","author":"Dekel","key":"10.1016\/0743-7315(89)90009-9_BIB5"},{"issue":"3","key":"10.1016\/0743-7315(89)90009-9_BIB6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1983.1676223","article-title":"Binary trees and parallel scheduling algorithms","volume":"C-32","author":"Dekel","year":"1983","journal-title":"IEEE Trans. Comput."},{"article-title":"Simultaneous memory access","year":"1979","author":"Eckstien","key":"10.1016\/0743-7315(89)90009-9_BIB7"},{"issue":"4","key":"10.1016\/0743-7315(89)90009-9_BIB8","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/360924.360941","article-title":"Parallelism in tape sorting","volume":"17","author":"Even","year":"1974","journal-title":"Comm. ACM"},{"issue":"10","key":"10.1016\/0743-7315(89)90009-9_BIB9","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/361020.361216","article-title":"Merging with parallel processors","volume":"18","author":"Garril","year":"1975","journal-title":"Comm. ACM"},{"year":"1976","series-title":"Fundamentals of Data Structures","author":"Horowitz","key":"10.1016\/0743-7315(89)90009-9_BIB10"},{"year":"1973","author":"Knuth","key":"10.1016\/0743-7315(89)90009-9_BIB11"},{"issue":"10","key":"10.1016\/0743-7315(89)90009-9_BIB12","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching merging and sorting in parallel computation","volume":"C-32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/0743-7315(89)90009-9_BIB13","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1981.1675805","article-title":"An on-chip compare\/steer bubble sorter","volume":"C-30","author":"Lee","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/0743-7315(89)90009-9_BIB14","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TC.1983.1676279","article-title":"Efficient VLSI networks for parallel processing based on orthogonal trees","volume":"C-32","author":"Nath","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/0743-7315(89)90009-9_BIB15","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","article-title":"The VLSI complexity of sorting","volume":"C-32","author":"Thompson","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/0743-7315(89)90009-9_BIB16","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1147\/rd.225.0509","article-title":"Algorithms and hardware for a merge sort using multiple processors","volume":"22","author":"Todd","year":"1978","journal-title":"IBM J. Res. Develop."},{"issue":"3","key":"10.1016\/0743-7315(89)90009-9_BIB17","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1977","journal-title":"SIAM J Comput."},{"issue":"1","key":"10.1016\/0743-7315(89)90009-9_BIB18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","article-title":"Implementation of simultaneous memory address access on models that forbid it","volume":"4","author":"Vishkin","year":"1983","journal-title":"J. Algorithms"},{"issue":"12","key":"10.1016\/0743-7315(89)90009-9_BIB19","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1109\/TC.1982.1675943","article-title":"The parallel enumeration sorting scheme for VLSI","volume":"C-31","author":"Yasuura","year":"1982","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900099?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:10Z","timestamp":1757514490000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0743731589900099"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90009-9","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1989,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel external merging","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(89)90009-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}