In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses

DOI10.1007/978-3-642-32589-2_25zbMath1365.68177OpenAlexW1545308509WikidataQ56049335 ScholiaQ56049335MaRDI QIDQ2912725

Jyrki Katajainen, Stefan Edelkamp, Amr Elmasry, Jingsen Chen

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_25

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop ⋮ Optimizing binary heaps ⋮ Weak heaps engineered ⋮ QuickHeapsort: modifications and improved analysis