{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T10:12:56Z","timestamp":1709460776199},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1007\/bf01952784","type":"journal-article","created":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T13:57:53Z","timestamp":1122904673000},"page":"69-74","source":"Crossref","is-referenced-by-count":2,"title":["Optimal parallel quicksort on EREW PRAM"],"prefix":"10.1007","volume":"31","author":[{"given":"Weixiong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nageswara S. V.","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01952784_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"K. Abrahamson, N. Dadoun, D. G. Kirkpatrick and T. Przytycka,A simple parallel tree contraction algorithm, Journal of Algorithms, vol. 10, 1989, pp. 287\u2013302.","journal-title":"Journal of Algorithms"},{"key":"BF01952784_CR2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwalet al., Parallel computational geometry, Algorithmica, vol. 3, 1988, pp. 293\u2013327.","journal-title":"Algorithmica"},{"key":"BF01952784_CR3","volume-title":"Parallel Sorting Algorithms","author":"S. G. Akl","year":"1985","unstructured":"S. G. Akl,Parallel Sorting Algorithms, Academic, Orlando, FL., 1985."},{"key":"BF01952784_CR4","series-title":"processors, Technical Report","volume-title":"Parallel selection in O(log logn)time using O(n\/log logn)","author":"S. G. Akl","year":"1988","unstructured":"S. G. Akl,Parallel selection in O(log logn)time using O(n\/log logn) processors, Technical Report. No. 221, Dept. of Computing and Information Science, Queen's University, Kingston, Ontario, March 1988."},{"key":"BF01952784_CR5","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley Pub. Co., 1974."},{"key":"BF01952784_CR6","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"M. J. Atallah","year":"1986","unstructured":"M. J. Atallah and M. T. Goodrich,Efficient parallel solutions to some geometric problems, J. of Parallel and Distributed Computing, vol. 3, 1986, pp. 492\u2013507.","journal-title":"J. of Parallel and Distributed Computing"},{"issue":"3","key":"BF01952784_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/2514.2516","volume":"13","author":"D. Bitton","year":"1984","unstructured":"D. Bitton, D. J. DeWitt, D. K. Hsiao and J. Menon,A taxonomy of parallel sorting, Computing Surveys, vol. 13, No. 3, 1984, pp. 287\u2013318.","journal-title":"Computing Surveys"},{"key":"BF01952784_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. P. Brent","year":"1974","unstructured":"R. P. Brent,The parallel evaluation of general arithmetic expressions, J. ACM, vol. 21, 1974, pp. 201\u2013206.","journal-title":"J. ACM"},{"issue":"4","key":"BF01952784_CR9","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole,Parallel merge sort, SIAM J. Comput., vol. 17, No. 4, 1988, pp. 770\u2013785.","journal-title":"SIAM J. Comput."},{"key":"BF01952784_CR10","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin,Approximate and exact scheduling with applications to list, tree and graph problems, Proc. 27th Ann. IEEE Symp. on the Foundations of Computer Science, 1986, pp. 478\u2013491.","DOI":"10.1109\/SFCS.1986.10"},{"issue":"3","key":"BF01952784_CR11","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L. Devroye","year":"1986","unstructured":"L. Devroye,A note on the height of binary search trees, J. ACM, vol. 33, No. 3, 1986, pp. 489\u2013498.","journal-title":"J. ACM"},{"key":"BF01952784_CR12","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0196-6774(88)90007-7","volume":"9","author":"X. He","year":"1988","unstructured":"X. He and Y. Yesha,Binary tree algebraic computation and parallel algorithms for simple graphs, J. of Algorithms, vol. 9, 1988, pp. 92\u2013113.","journal-title":"J. of Algorithms"},{"issue":"1","key":"BF01952784_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/12.46289","volume":"39","author":"P. Heidelberger","year":"1990","unstructured":"P. Heidelberger, A. Norton and J.T. Robinson,Parallel quicksort using fetch-and-add, IEEE Trans. on Computers, vol. 39, No. 1, 1990, pp. 133\u2013138.","journal-title":"IEEE Trans. on Computers"},{"key":"BF01952784_CR14","unstructured":"C. P. Kruskal,Algorithms for replace-add based paracomputers, Proc. of Intern. Conf. on Parallel Processing, 1982, pp. 219\u2013223."},{"key":"BF01952784_CR15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01840376","volume":"5","author":"C. P. Kruskal","year":"1990","unstructured":"C. P. Kruskal, Larry Rudolph and Marc Snir,Efficient parallel algorithms for graph problems, Algorithmica, vol. 5, 1990, pp. 43\u201365.","journal-title":"Algorithmica"},{"key":"BF01952784_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(89)90116-6","volume":"30","author":"C. U. Martel","year":"1989","unstructured":"C. U. Martel and D. Gusfield,A fast parallel quicksort algorithm, Information Processing Letters, vol. 30, Jan. 1989, pp. 97\u2013102.","journal-title":"Information Processing Letters"},{"issue":"6","key":"BF01952784_CR17","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TC.1985.5009411","volume":"34","author":"A. Moitra","year":"1985","unstructured":"A. Moitra and S. S.Iyengar, A maximally parallel balancing algorithm for obtaining complete balanced binary trees, IEEE Trans. on Computers, vol. 34, No. 6, June, 1985, pp. 563\u2013565.","journal-title":"IEEE Trans. on Computers"},{"key":"BF01952784_CR18","first-page":"84","volume-title":"Derivation of a maximally parallel algorithm for balancing binary search tree","author":"A. Moitra","year":"1984","unstructured":"A. Moitra and S. S. Iyengar,Derivation of a maximally parallel algorithm for balancing binary search tree, Dept. of Computer Science, Cornell University, Ithaca, NY, Tech. Rep. 84\u2013638, Sept. 1984."},{"key":"BF01952784_CR19","unstructured":"F. P. Preparata and M. I. Shamos,Computational Geometry \u2014 An Introduction, Springer-Verlag, 1989."},{"key":"BF01952784_CR20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","volume":"4","author":"U. Vishkin","year":"1983","unstructured":"U. Vishkin,Implementation of simultaneous memory address access in models that forbid it, J. of Algorithms, vol. 4, 1983, pp. 45\u201350.","journal-title":"J. of Algorithms"},{"key":"BF01952784_CR21","unstructured":"U. Vishkin,Synchronous parallel computation \u2014 A survey, Technical Report, No. 71, Dept. of Computer Science, Courant Institute, NYU, 1983."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01952784.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01952784\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01952784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T13:14:27Z","timestamp":1557753267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01952784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF01952784"],"URL":"https:\/\/doi.org\/10.1007\/bf01952784","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}