{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:49Z","timestamp":1725664129123},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_241","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:09:18Z","timestamp":1330243758000},"page":"118-127","source":"Crossref","is-referenced-by-count":4,"title":["A framework for constructing heap-like structures in-place"],"prefix":"10.1007","author":[{"given":"Jingsen","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopocroft, and J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974."},{"issue":"10","key":"13_CR2","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1145\/6617.6621","volume":"29","author":"M. D. Atkinson","year":"1986","unstructured":"M. D. Atkinson, J.-R. Sack, N. Santoro, and Th. Strothotte: Min-max heaps and generalized priority queues. CACM 29 (10) (1986), 996\u20131000.","journal-title":"CACM"},{"issue":"4","key":"13_CR3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(87)90142-6","volume":"24","author":"S. Carlsson","year":"1987","unstructured":"S. Carlsson: A variant of heapsort with almost optimal number of comparisons. Information Processing Letters 24 (4) (1987), 247\u2013250.","journal-title":"Information Processing Letters"},{"issue":"1","key":"13_CR4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01937350","volume":"27","author":"S. Carlsson","year":"1987","unstructured":"S. Carlsson: Average-case results on heapsort. BIT 27 (1) (1987), 2\u201317.","journal-title":"BIT"},{"issue":"1","key":"13_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(87)90033-0","volume":"26","author":"S. Carlsson","year":"1987","unstructured":"S. Carlsson: The deap \u2014 A double-ended heap to implement double-ended priority queues. Information Processing Letters 26 (1) (1987), 33\u201336.","journal-title":"Information Processing Letters"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"L. Draws, P. Eriksson, E. Forslund, L. H\u00f6glund, S. Vallner, and Th. Strothotte: Two new algorithms for constructing min-max heaps. In: Proce. 1st SWAT (1988), 43\u201350.","DOI":"10.1007\/3-540-19487-8_5"},{"key":"13_CR7","volume-title":"Technical Report A-1979-1","author":"H. Erki\u00f6","year":"1979","unstructured":"H. Erki\u00f6: On heapsort and its dependence on input data. Technical Report A-1979-1. Department of Computer Science, University of Helsinki, Finland, 1979."},{"issue":"12","key":"13_CR8","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R. W. Floyd","year":"1964","unstructured":"R. W. Floyd: Algorithm 245 \u2014 Treesort 3. CACM 7 (12) (1964), 701.","journal-title":"CACM"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"G. H. Gonnet","year":"1986","unstructured":"G. H. Gonnet and J. I. Munro: Heaps on heaps. SIAM J. Comput. 15 (1986), 964\u2013971.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"13_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01933726","volume":"27","author":"A. Hasham","year":"1987","unstructured":"A. Hasham and J.-R. Sack: Bounds for min-max heaps. BIT 27 (3) (1987), 315\u2013323.","journal-title":"BIT"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D. B. Johnson","year":"1979","unstructured":"D. B. Johnson: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 24 (1) (1979), 1\u201313.","journal-title":"Journal of the ACM"},{"key":"13_CR12","volume-title":"The Art of Computer Programming. Vol. 3: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth: The Art of Computer Programming. Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"S. Okoma: Generalized heapsort. In: Proce. 9 th MFCS (1980), 439\u2013451.","DOI":"10.1007\/BFb0022523"},{"issue":"2","key":"13_CR14","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"A. Sch\u00f6nhage","year":"1976","unstructured":"A. Sch\u00f6nhage, M. Paterson, and N. Pippenger: Finding the median. Journal of Computer and System Sciences 13 (2) (1976), 184\u2013199.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"13_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01952680","volume":"29","author":"T. Strothotte","year":"1989","unstructured":"Th. Strothotte, P. Eriksson, and S. Vallner: A note on constructing min-max heaps. BIT 29 (2) (1989), 251\u2013256.","journal-title":"BIT"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"J. Vuillemin: A data structure for manipulating priority queues. CACM 21 (1978), 309\u2013314.","journal-title":"CACM"},{"issue":"6","key":"13_CR17","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. CACM 7 (6) (1964), 347\u2013348.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_241.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:39:48Z","timestamp":1640911188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_241","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}