A SIMPLE ARRAY VERSION OF M-HEAP

DOI10.1142/S012905411450004XzbMath1291.68153MaRDI QIDQ5168425

Haejae Jung

Publication date: 4 July 2014

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

zbMATH Keywords

performancepriority queueheapdata structure

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: A SIMPLE ARRAY VERSION OF M-HEAP