{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:06:38Z","timestamp":1753437998891},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":[[1994,4]]},"DOI":"10.1016\/0020-0190(94)00009-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"81-87","source":"Crossref","is-referenced-by-count":17,"title":["An optimal parallel algorithm for merging using multiselection"],"prefix":"10.1016","volume":"50","author":[{"given":"Narsingh","family":"Deo","sequence":"first","affiliation":[]},{"given":"Amit","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Muralidhar","family":"Medidi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/0020-0190(94)00009-3_BIB1","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TC.1987.5009478","article-title":"Optimal parallel merging and sorting without memory conflicts","volume":"36","author":"Akl","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(94)00009-3_BIB2","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0890-5401(89)90003-5","article-title":"Parallel approximation algorithms for bin packing","volume":"82","author":"Anderson","year":"1989","journal-title":"Inform. and Comput."},{"issue":"2","key":"10.1016\/0020-0190(94)00009-3_BIB3","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0218014","article-title":"Adaptive bitonic sorting: An optimal parallel algorithm for shared memory machines","volume":"18","author":"Bilardi","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0020-0190(94)00009-3_BIB4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00009-3_BIB5","first-page":"121","article-title":"Parallel algorithms for merging and sorting","volume":"51","author":"Deo","year":"1990","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0190(94)00009-3_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","article-title":"The complexity of selection and ranking in X + Y and matrices with sorted columns","volume":"24","author":"Frederickson","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00009-3_BIB7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(89)90138-5","article-title":"Optimal merging and sorting on the EREW PRAM","volume":"33","author":"Hagerup","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00009-3_BIB8","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/0020-0190(94)00009-3_BIB9_1","first-page":"597","article-title":"Parallel dictionaries on 2\u20133 trees","volume":"154","author":"Paul","year":"1983","journal-title":"Proc. ICALP"},{"key":"10.1016\/0020-0190(94)00009-3_BIB9_2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1051\/ita\/1983170403971","article-title":"Parallel dictionaries on 2\u20133 trees","volume":"17","author":"Paul","year":"1983","journal-title":"RAIRO Inform. Th\u00e9or. \/ Theoret. Inform."},{"key":"10.1016\/0020-0190(94)00009-3_BIB10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging, and sorting in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)00009-3_BIB11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-8191(90)90040-G","article-title":"Parallel merging: Algorithm and implementation results","volume":"15","author":"Varman","year":"1990","journal-title":"Parallel Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:50:18Z","timestamp":1555145418000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0020019094000093"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00009-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}