{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:29:21Z","timestamp":1649017761674},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8082,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0304-3975(91)90279-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"275-285","source":"Crossref","is-referenced-by-count":1,"title":["Parallel comparison merging of many-ordered lists"],"prefix":"10.1016","volume":"83","author":[{"given":"Y.","family":"Azar","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90279-B_BIB1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/0401028","article-title":"Sorting, approximate sorting and searching in rounds","author":"Alon","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0304-3975(91)90279-B_BIB2","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1137\/0217074","article-title":"The average complexity of deterministic and randomized parallel comparison sorting algorithms","volume":"6","author":"Alon","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90279-B_BIB3","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/SFCS.1988.21937","article-title":"Parallel comparison algorithms for approximation problems","author":"Alon","year":"1988","journal-title":"Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90279-B_BIB4","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1137\/0218017","article-title":"Finding an approximate maximum","volume":"2","author":"Alon","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90279-B_BIB5","first-page":"502","article-title":"Tight complexity bounds for parallel comparison sorting","author":"Alon","year":"1986","journal-title":"Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90279-B_BIB6","series-title":"Parallel Sorting Algorithms","author":"Akl","year":"1985"},{"key":"10.1016\/0304-3975(91)90279-B_BIB7_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n parallel steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(91)90279-B_BIB7_2","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90279-B_BIB8","first-page":"188","article-title":"Deterministic selection in O(log log n) parallel time","author":"Ajtai","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90279-B_BIB9","first-page":"98","article-title":"Expanders, sorting in rounds and superconcentrators of limited depth","author":"Alon","year":"1985","journal-title":"Proc. 17th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90279-B_BIB10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0166-218X(90)90128-Y","article-title":"Parallel selection","volume":"27","author":"Azar","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(91)90279-B_BIB11","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1137\/0216032","article-title":"Tight comparison bounds on the complexity of parallel sorting","volume":"3","author":"Azar","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90279-B_BIB12","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","article-title":"Routing, merging and sorting on parallel models of computation","volume":"30","author":"Borodin","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90279-B_BIB13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(89)90194-4","article-title":"The average-case parallel complexity of sorting","volume":"33","author":"Boppana","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90279-B_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(83)90095-1","article-title":"Parallel sorting","volume":"6","author":"Bollob\u00e1s","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(91)90279-B_BIB15","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\/0304-3975(91)90279-B_BIB16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1109\/SFCS.1987.55","article-title":"The complexity of parallel comparison merging","author":"Ger\u00e9b-Graus","year":"1987","journal-title":"Proc. 28th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90279-B_BIB17","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0210034","article-title":"Parallel sorting with constant time for comparisons","volume":"10","author":"H\u00e4ggkvist","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90279-B_BIB18","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0603047","article-title":"Sorting and merging in rounds","volume":"3","author":"H\u00e4ggkvist","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(91)90279-B_BIB19","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging and sorting in parallel computation","volume":"32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90279-B_BIB20","first-page":"71","article-title":"Tight bounds on the complexity of parallel sorting","author":"Leighton","year":"1984","journal-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90279-B_BIB21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0213008","article-title":"The effect of the number of hamiltonian paths on the complexity of a vertex coloring problem","volume":"13","author":"Manber","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90279-B_BIB22","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1137\/0216066","article-title":"Sorting and selecting in rounds","volume":"6","author":"Pippenger","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90279-B_BIB23","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1109\/SFCS.1981.6","article-title":"A fast probabilistic sorting algorithm","author":"Reischuk","year":"1981","journal-title":"Proc. 22nd Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90279-B_BIB24","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 model of computation","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(91)90279-B_BIB25","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90279-B_BIB26","first-page":"222","article-title":"Probabilistic computations: towards a unified measure of complexity","author":"Yao","year":"1977","journal-title":"Proc. 18th Ann. IEEE Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190279B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190279B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:26:00Z","timestamp":1580901960000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190279B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["030439759190279B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90279-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}