{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:20:55Z","timestamp":1725600055129},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226021"},{"type":"electronic","value":"9783642226038"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22603-8_58","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:35:07Z","timestamp":1312878907000},"page":"667-675","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Non-Quadratic Quick Sort (NQQuickSort)"],"prefix":"10.1007","author":[{"given":"Amjad M.","family":"Daoud","sequence":"first","affiliation":[]},{"given":"Hussein","family":"Abdel-jaber","sequence":"additional","affiliation":[]},{"given":"Jafar","family":"Ababneh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, A., Nilsson, S.: Implementing Radixsort. ACM Journal of Experimental Algorithmics\u00a03(7) (1998)","DOI":"10.1145\/297096.297136"},{"issue":"11","key":"58_CR3","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"J.L. Bentley","year":"1993","unstructured":"Bentley, J.L., McIlroy, M.D.: Engineering a Sort Function. Software Practice and Experience\u00a023(11), 1249\u20131265 (1993)","journal-title":"Software Practice and Experience"},{"key":"58_CR4","unstructured":"Bhutoria, S., Konjevod, G.: Quickening Quick-Sort. In: REAS 2003 (2003)"},{"key":"58_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 145\u2013164. MIT Press, McGraw-Hill (2001) ISBN 0-262-03293-7"},{"issue":"1","key":"58_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2005.07.005","volume":"154","author":"B.C. Dean","year":"2006","unstructured":"Dean, B.C.: A Simple Expected Running Time Analysis for Randomized \u2019Divide and Conquer\u2019 Algorithms. Discrete Applied Mathematics\u00a0154(1), 1\u20135 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"58_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(78)90028-5","volume":"7","author":"W. Dobosiewicz","year":"1978","unstructured":"Dobosiewicz, W.: Sorting by Distributive Partition. Information Processing Letters\u00a07(1), 1\u20136 (1978)","journal-title":"Information Processing Letters"},{"key":"58_CR8","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1145\/320964.320972","volume":"6","author":"P. Hildebrandt","year":"1959","unstructured":"Hildebrandt, P., Isbitz, H., Mehlhorn, K.: Radix Exchange- An Internal Sorting Method for digital computers. JACM\u00a06, 156\u2013163 (1959)","journal-title":"JACM"},{"issue":"7","key":"58_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: \u201dPartition: Algorithm 63,\u201d \u201dQuicksort: Algorithm 64,\u201d and \u201dFind: Algorithm 65\u201d. Comm. ACM\u00a04(7), 321\u2013322 (1961)","journal-title":"Comm. ACM"},{"issue":"1","key":"58_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. Computer Journal\u00a05(1), 10\u201315 (1962) (reprinted in Hoare and Jones: Essays in computing science, 1989)","journal-title":"Computer Journal"},{"key":"58_CR11","first-page":"113","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn., vol.\u00a03, pp. 113\u2013122. Addison-Wesley, Reading (1973) ISBN 0-201-89685-0","edition":"2"},{"key":"58_CR12","unstructured":"LaMarca, A., Ladner, R.E.: The Influence of Caches on the Performance of Sorting. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 370\u2013379 (1997)"},{"key":"58_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comjnl\/35.1.1","volume":"35","author":"K.K. Lau","year":"1992","unstructured":"Lau, K.K.: Top-Down Synthesis of Sorting Algorithms. The Computer Journal\u00a035, A001\u2013A007 (1992)","journal-title":"The Computer Journal"},{"issue":"3","key":"58_CR14","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/S0097539700382108","volume":"31","author":"C. Martnez","year":"2001","unstructured":"Martnez, C., Roura, S.: Optimal sampling strategies in quicksort and quickselect. SIAM J. Computing\u00a031(3), 683\u2013705 (2001)","journal-title":"SIAM J. Computing"},{"key":"58_CR15","unstructured":"Maus, A.: ARL: A Faster In-place, Cache Friendly Sorting Algorithm. In: Norsk Informatikkonferranse NIK 2002, pp. 85\u201395 (2002)"},{"issue":"1","key":"58_CR16","first-page":"5","volume":"6","author":"P. McIlroy","year":"1993","unstructured":"McIlroy, P., Bostic, K., McIlroy, M.: Engineering Radix Sort. Computer Systems\u00a06(1), 5\u201327 (1993)","journal-title":"Computer Systems"},{"issue":"0","key":"58_CR17","first-page":"1","volume":"29","author":"M. Douglas McIlroy","year":"1999","unstructured":"Douglas McIlroy, M.: A Killer Adversary for Quicksort. Software Practice and Experience\u00a029(0), 1\u20134 (1999)","journal-title":"Software Practice and Experience"},{"key":"58_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. Springer, Heidelberg (1984)"},{"issue":"8","key":"58_CR19","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1002\/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#","volume":"27","author":"D.R. Musser","year":"1997","unstructured":"Musser, D.R.: Introspective Sorting and Selection Algorithms. Software Practice and Experience\u00a027(8), 983\u2013993 (1997)","journal-title":"Software Practice and Experience"},{"issue":"10","key":"58_CR20","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R. Sedgewick","year":"1978","unstructured":"Sedgewick, R.: Implementing Quicksort programs. Communications of the ACM\u00a021(10), 847\u2013857 (1978)","journal-title":"Communications of the ACM"},{"key":"58_CR21","first-page":"1","volume-title":"Algorithms in Java, Parts 1-4","author":"R. Sedgewick","year":"2003","unstructured":"Sedgewick, R.: Algorithms in Java, Parts 1-4, 3rd edn., pp. 1\u20134. Addison-Wesley, Reading (2003)","edition":"3"},{"key":"58_CR22","volume-title":"An Introduction to the Analysis of Algorithms","author":"R. Sedgewick","year":"1996","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996)"}],"container-title":["Communications in Computer and Information Science","Digital Enterprise and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22603-8_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T03:19:44Z","timestamp":1554002384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22603-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226021","9783642226038"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22603-8_58","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}