{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:20Z","timestamp":1757629520108,"version":"3.44.0"},"reference-count":35,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":[[1991,4]]},"DOI":"10.1016\/0743-7315(91)90040-g","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"332-337","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Parallel quicksort"],"prefix":"10.1016","volume":"11","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[]},{"given":"Imrich","family":"Vr\u0165o","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(91)90040-G_BIB1_1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","article-title":"A simple parallel tree contraction algorithm","volume":"10","author":"Abrahamson","year":"1989","journal-title":"J. Algorithms"},{"year":"1987","series-title":"Proc. 25th Allerton Conference on Communication, Control and Computing","author":"Abrahamson","key":"10.1016\/0743-7315(91)90040-G_BIB1_2"},{"key":"10.1016\/0743-7315(91)90040-G_BIB2_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"An O(n log n) sorting network","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0743-7315(91)90040-G_BIB2_2","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/0743-7315(91)90040-G_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02243071","article-title":"Optimal parallel algorithms for computing convex hulls and for sorting","volume":"33","author":"Aid","year":"1984","journal-title":"Computing"},{"year":"1985","series-title":"Parallel Sorting Algorithms","author":"Akl","key":"10.1016\/0743-7315(91)90040-G_BIB4"},{"key":"10.1016\/0743-7315(91)90040-G_BIB5_1","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":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0743-7315(91)90040-G_BIB5_2","series-title":"Proc. 14th Annual ACM Symposium on Theory of Computing","first-page":"338","article-title":"Routing, merging and sorting on parallel-models of computation","author":"Borodin","year":"1982"},{"key":"10.1016\/0743-7315(91)90040-G_BIB6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(89)90120-8","article-title":"Parallel iterated bucket sort","volume":"31","author":"Chlebus","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(91)90040-G_BIB7","series-title":"Proc. 7th International Conference on Fundamentals of Computation Theory","first-page":"95","article-title":"New simulations between CRCW PRAMS","volume":"Vol. 380","author":"Chlebus","year":"1989"},{"key":"10.1016\/0743-7315(91)90040-G_BIB8","unstructured":"Chlebus, B. S., and Vrio. Unifying binary search trees and permutations. Submitted for publication."},{"key":"10.1016\/0743-7315(91)90040-G_BIB9_1","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\/0743-7315(91)90040-G_BIB9_2","series-title":"Proc. 27th Annual IEEE Symposium on Foundations of Computer Science","first-page":"511","author":"Cole","year":"1986"},{"key":"10.1016\/0743-7315(91)90040-G_BIB10","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/5925.5930","article-title":"A note on the height of binary search trees","volume":"33","author":"Devroye","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-7315(91)90040-G_BIB11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00265991","article-title":"Branching processes in the analysis of the heights of trees","volume":"24","author":"Devroye","year":"1987","journal-title":"Acta Inform."},{"volume":"Vol. 1","year":"1950","author":"Feller","key":"10.1016\/0743-7315(91)90040-G_BIB12"},{"key":"10.1016\/0743-7315(91)90040-G_BIB13","first-page":"453","article-title":"An optimal parallel algorithm for dynamic tree expression evaluation and its applications","author":"Gibbons","year":"1986"},{"year":"1988","series-title":"Efficient Parallel Algorithms","author":"Gibbons","key":"10.1016\/0743-7315(91)90040-G_BIB14"},{"key":"10.1016\/0743-7315(91)90040-G_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(89)90066-5","article-title":"Hybridsort revisited and parallelized","volume":"32","author":"Hagerup","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(91)90040-G_BIB16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","article-title":"Towards optimal parallel bucket sorting","volume":"75","author":"Hagerup","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0743-7315(91)90040-G_BIB17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/12.46289","article-title":"Parallel quicksort using fetch-and-add","volume":"39","author":"Heidelberg","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90040-G_BIB18","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Comput. J."},{"key":"10.1016\/0743-7315(91)90040-G_BIB19","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/TC.1983.1676280","article-title":"Divide-and-conquer for parallel processing","volume":"C-32","author":"Horowitz","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90040-G_BIB20","series-title":"Proc. 3rd Aegean Workshop on Computing","article-title":"Optimal parallel evaluation of tree structured computation by raking","author":"Kosaraju","year":"1988"},{"key":"10.1016\/0743-7315(91)90040-G_BIB21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(89)90116-6","article-title":"A fast parallel quicksort algorithm","volume":"30","author":"Martel","year":"1989","journal-title":"Inform. Process. Lett."},{"year":"1987","series-title":"Parallel Complexity Theory","author":"Parberry","key":"10.1016\/0743-7315(91)90040-G_BIB22"},{"key":"10.1016\/0743-7315(91)90040-G_BIB23_1","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","article-title":"Optimal and sublogarithmic time randomized parallel sorting algorithms","volume":"18","author":"Rajasekaran","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(91)90040-G_BIB23_2","series-title":"Proc. 26th Annual IEEE Symposium on Foundations of Computer Science","first-page":"496","article-title":"An optimal parallel algorithm for integer sorting","author":"Rajasekaran","year":"1985"},{"key":"10.1016\/0743-7315(91)90040-G_BIB24_1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/7531.7532","article-title":"A logarithmic time sort for linear size networks","volume":"34","author":"Reif","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-7315(91)90040-G_BIB24_2","series-title":"Proc. 15th Annual ACM Symposium on Theory of Computing","first-page":"10","author":"Reif","year":"1983"},{"key":"10.1016\/0743-7315(91)90040-G_BIB25_1","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/0214030","article-title":"Probabilistic algorithms for sorting and selection","volume":"14","author":"Reischuk","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(91)90040-G_BIB25_2","series-title":"Proc. 22nd Annual IEEE Symposium on Foundations of Computer Science","first-page":"212","article-title":"A fast probabilistic parallel sorting algorithm","author":"Reischuk","year":"1981"},{"key":"10.1016\/0743-7315(91)90040-G_BIB26","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\/0743-7315(91)90040-G_BIB27","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\/0743-7315(91)90040-G_BIB28","series-title":"Proc. Symposium Algoritmy","article-title":"Asymptotically optimal parallel sorting algorithm","author":"Wiedermann","year":"1977"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190040G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190040G?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:14Z","timestamp":1757514494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190040G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["074373159190040G"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90040-g","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel quicksort","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(91)90040-G","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}