{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:40Z","timestamp":1725550480491},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297697"},{"type":"electronic","value":"9783540321002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11576235_51","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T15:32:46Z","timestamp":1129649566000},"page":"491-502","source":"Crossref","is-referenced-by-count":1,"title":["A Cost Optimal Parallel Quicksorting and Its Implementation on a Shared Memory Parallel Computer"],"prefix":"10.1007","author":[{"given":"Jie","family":"Liu","sequence":"first","affiliation":[]},{"given":"Clinton","family":"Knowles","sequence":"additional","affiliation":[]},{"given":"Adam Brian","family":"Davis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","volume-title":"Parallel Sorting Algorithms","author":"S.G. Akl","year":"1985","unstructured":"Akl, S.G.: Parallel Sorting Algorithms. Academic Press, Orlando (1985)"},{"issue":"2","key":"51_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/321879.321882","volume":"22","author":"D.E. Muller","year":"1975","unstructured":"Muller, D.E., Preparata, F.P.: Bounds and complexities of networks for sorting and for switching. Journal of the ACM\u00a022(2), 195\u2013201 (1975)","journal-title":"Journal of the ACM"},{"key":"51_CR3","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, Reading (1973)"},{"key":"51_CR4","first-page":"307","volume-title":"Proceedings of the AFIPS Spring Joint Computer Conference","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting Networks and Their Applications. In: Proceedings of the AFIPS Spring Joint Computer Conference, vol.\u00a032, pp. 307\u2013314. AFIPS Press, Reston (1968)"},{"issue":"8","key":"51_CR5","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1145\/359576.359582","volume":"21","author":"D.S. Hirschberg","year":"1978","unstructured":"Hirschberg, D.S.: Fast Parallel Sorting Algorithms. Communications of the ACM\u00a021(8), 657\u2013666 (1978)","journal-title":"Communications of the ACM"},{"issue":"7","key":"51_CR6","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/TC.1978.1675167","volume":"27","author":"F.P. Preparata","year":"1978","unstructured":"Preparata, F.P.: New Parallel Sorting Schemes. IEEE Transactions. on Computers\u00a0C-27(7), 669\u2013673 (1978)","journal-title":"IEEE Transactions. on Computers"},{"key":"51_CR7","first-page":"71","volume-title":"Proceedings of the 16th Annual ACM S. on Theory of Computing","author":"F.T. Leighton","year":"1983","unstructured":"Leighton, F.T.: Tight bounds on the complexity of parallel sorting. In: Proceedings of the 16th Annual ACM S. on Theory of Computing, May 1983, pp. 71\u201380. ACM, New York (1983)"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/0167-8191(92)90089-P","volume":"18","author":"R.S. Francis","year":"1992","unstructured":"Francis, R.S., Pannan, L.J.H.: A parallel partition for enhanced parallel Quicksort. Parallel Computing\u00a018, 543\u2013550 (1992)","journal-title":"Parallel Computing"},{"issue":"1","key":"51_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/12.46289","volume":"39","author":"P. Heideberger","year":"1990","unstructured":"Heideberger, P., Norton, A., Robinson, J.T.: Parallel Quicksort Using Fetch-and-Add. IEEE Transaction on Computer, vol\u00a0C-39(1), 133\u2013138 (1990)","journal-title":"IEEE Transaction on Computer, vol"},{"key":"51_CR10","volume-title":"Parallel Computing Theory and Practice","author":"M.J.. Quinn","year":"1994","unstructured":"Quinn, M.J.: Parallel Computing Theory and Practice. McGraw-Hill, Inc, New York (1994)"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1006\/jagm.1995.1044","volume":"19","author":"W. Eddy","year":"1995","unstructured":"Eddy, W., Schervish, M.: How Many Comparisons Does Quicksort Use. J. Algorithms\u00a019, 402\u2013431 (1995)","journal-title":"J. Algorithms"},{"issue":"2","key":"51_CR12","first-page":"201","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"Brent, R.P.: The parallel Evaluation of General Arithmetic Expressions. J. of the ACT\u00a021(2), 201\u2013206 (1974)","journal-title":"J. of the ACT"},{"key":"51_CR13","volume-title":"Efficient Parallel Algorithms","author":"A. Gibbons","year":"1988","unstructured":"Gibbons, A., Rytter, W.: Efficient Parallel Algorithms. Cambridge U. Press, Cambridge (1988)"},{"key":"51_CR14","unstructured":"Liu, J., He, J.: A Cost Optimal Parallel Quicksort On CREW PRAM. In: The Proceedings of CATA 2003, Honolulu, Hawaii, pp. 13\u201316 (2003)"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11576235_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:43:53Z","timestamp":1619505833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11576235_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297697","9783540321002"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11576235_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}