M-Heap: A Modified Heap Data Structure

DOI10.1142/S0129054103001856MaRDI QIDQ5696922zbMATH OpenFDO

Authors

Publication date 19 October 2005

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

zbMATH Keywords

deletioninsertionsortingheapsdatastructure

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A simple array version of M-heap
• Theory of 2-3 heaps
• scientific article; zbMATH DE number 1696652
• Cascade heap: towards time-optimal extractions
• Hollow Heaps

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Worst-case analysis of a generalized heapsort algorithm

Cited in

(7)

• Theory of 2-3 heaps
• Two skew-binary numeral systems and one application
• The weak-heap data structure: variants and applications
• scientific article; zbMATH DE number 1696652 (Why is no real title available?)
• Available stabilizing heaps
• scientific article; zbMATH DE number 1471816 (Why is no real title available?)
• A simple array version of M-heap

This page was built for publication: M-Heap: A Modified Heap Data Structure

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