A simple array version of M-heap

DOI10.1142/S012905411450004XMaRDI QIDQ5168425zbMATH OpenFDO

Authors Haejae Jung

Publication date 4 July 2014

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S012905411450004X

zbMATH Keywords

data structureheapperformancepriority queue

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• M-Heap: A Modified Heap Data Structure
• Hollow Heaps
• Hollow heaps
• Cascade heap: towards time-optimal extractions
• Pairing heaps, scrambled pairing and square-root trees

Cites work

• M-Heap: A Modified Heap Data Structure
• Supernode Binary Search Trees
• The d-deap\(^*\): a fast and simple cache-aligned d-ary deap
• The pairing heap: A new form of self-adjusting heap

Cited in

(1)

• M-Heap: A Modified Heap Data Structure

This page was built for publication: A simple array version of M-heap

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