M-Heap: A Modified Heap Data Structure

DOI10.1142/S0129054103001856zbMATH Open1101.68484MaRDI QIDQ5696922FDOQ5696922

Authors:

Publication date: 19 October 2005

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

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

zbMATH Keywords

deletioninsertionsortingheapsdatastructure

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Available stabilizing heaps
• 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)