{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:16Z","timestamp":1725456136958},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010027X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022523","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:49:12Z","timestamp":1132724952000},"page":"439-451","source":"Crossref","is-referenced-by-count":3,"title":["Generalized heapsort"],"prefix":"10.1007","author":[{"given":"Seiichi","family":"Okoma","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"32_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: Heapsort. Comm. ACM, Vol. 7, No. 6, pp.347\u2013348(1964).","journal-title":"Comm. ACM"},{"issue":"12","key":"32_CR2","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R.W. Floyd","year":"1964","unstructured":"Floyd, R.W.: Algorithm 245: Treesort 3. Comm. ACM, Vol.7, No.12, p.701(1964).","journal-title":"Comm. ACM"},{"key":"32_CR3","unstructured":"Aho, A.V., Hopcroft, J.E. and Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, pp.87\u201392(1974)."},{"key":"32_CR4","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol.3\/ Sorting and Searching. Addison-Wesley Publishing Company, PP.145\u2013147(1973)."},{"issue":"7","key":"32_CR5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/368370.368387","volume":"2","author":"D.L. Shell","year":"1959","unstructured":"Shell, D.L.: A High-Speed Sorting Procedure. Comm. ACM, Vol.2, No.7, PP.30\u201332(1959).","journal-title":"Comm. ACM"},{"issue":"10","key":"32_CR6","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R. Sedgewick","year":"1978","unstructured":"Sedgewick, R.: Implementing Quicksort Programs. Comm. ACM, Vol.21, No.10, PP.847\u2013857(1978).","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022523.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T07:07:18Z","timestamp":1626764838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0022523","relation":{},"subject":[]}}