{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:21:52Z","timestamp":1725492112496},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439776"},{"type":"electronic","value":"9783540456438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45643-0_15","type":"book-chapter","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T00:58:33Z","timestamp":1190681913000},"page":"194-205","source":"Crossref","is-referenced-by-count":0,"title":["An Improvement on Tree Selection Sort"],"prefix":"10.1007","author":[{"given":"Jingchao","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"J.W.J. Williams, Algorithm 232, Heapsort 3, Comm.ACM, 7, 1964, pp. 347\u2013348.","journal-title":"Comm.ACM"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"R.W. Floyd, Algorithm 245, Treesort 3, Comm.ACM, 1964, p. 701.","DOI":"10.1145\/355588.365103"},{"issue":"7","key":"15_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"C.A.R. Hoare, Algorithm 63,64 and 65, Comm.ACM, 4(7), 1961,pp. 321\u2013322.","journal-title":"Comm.ACM"},{"issue":"2","key":"15_CR4","first-page":"34","volume":"3","author":"E.H. Friend","year":"1956","unstructured":"E.H. Friend, Sorting on electronic computers, JACM 3(2), 1956, pp. 34\u2013168.","journal-title":"JACM"},{"key":"15_CR5","volume-title":"The Art of Computer Programming Vol.3: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth, \u201cThe Art of Computer Programming Vol.3: Sorting and Searching\u201d, Addison-Wesley, Reading, MA, 1973"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0890-5401(92)90005-Z","volume":"97","author":"I. Wegener","year":"1992","unstructured":"I. Wegener, The worst case complexity of McDiarmid and Reed\u2019s variant of Bottom-Up heapsort is less than nlogn+1.1n, information and computation, 97, 1992, pp. 86\u201396.","journal-title":"information and computation"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"C.J.H. McDiarmid and B.A. Reed, Building heaps fast, J. Algorithms 10, pp. 352\u2013369.","DOI":"10.1016\/0196-6774(89)90033-3"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"S. Carlsson, A variant of heapsort with almost optimal number of comparisons, Inform. Process. Lett. 24, pp. 247\u2013250.","DOI":"10.1016\/0020-0190(87)90142-6"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"G.H. Gonnet and J.I. Munro, Heaps on heaps, Proc. 9th ICALP, Aarhus, Denmark, July 12\u201316, 1982,pp. 282\u2013291.","DOI":"10.1007\/BFb0012776"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/BF01990520","volume":"33","author":"R.D. Dutton","year":"1993","unstructured":"R.D. Dutton, Weak-heap sort, BIT 33, 1993,pp. 372\u2013381.","journal-title":"BIT"},{"key":"15_CR11","first-page":"271","volume":"3","author":"J.C. Chen","year":"1996","unstructured":"J.C. Chen, Proportion split sort, Nordic Journal of Computing 3(1996), pp. 271\u2013279.","journal-title":"Nordic Journal of Computing"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/S0097539798342903","volume":"31","author":"J.C. Chen","year":"2001","unstructured":"J.C. Chen, Proportion extend sort, SIAM Journal on Computing, Vol. 31, No. 1, 2001, pp. 323\u2013330.","journal-title":"SIAM Journal on Computing"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.1998.0985","volume":"31","author":"A. LaMarca","year":"1999","unstructured":"A. LaMarca and R.E. Lader, The influence of Caches on the performance of sorting, J. Algorithms 31, 1999, pp. 66\u2013104.","journal-title":"J. Algorithms"},{"issue":"10","key":"15_CR14","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R. Sedgewick","year":"1978","unstructured":"R. Sedgewick, Implementing quicksort programs. Communications of the ACM, 21(10), pp. 847\u2013857, October, 1978.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45643-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T06:20:46Z","timestamp":1629786046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45643-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439776","9783540456438"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45643-0_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}