Performance engineering case study

DOI10.1145/351827.384257MaRDI QIDQ5463417zbMATH OpenOpenAlexWikidataFDO

Authors Jesper Bojesen, Jyrki Katajainen, Maz Spork

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/351827.384257

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Recommendations

• In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
• Building heaps fast
• Elementary yet precise worst-case analysis of Floyd's heap-construction program
• Heap construction: Optimal in both worst and average cases?
• Irredundant intervals

Cited in

(2)

• Weak heaps engineered
• Irredundant intervals

This page was built for publication: Performance engineering case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463417)