A simpler implementation and analysis of Chazelle's soft heaps

MaRDI QIDQ4633857zbMATH OpenFDO

Authors Haim Kaplan, Uri Zwick

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496823

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Soft heaps simplified
• The soft heap
• External memory soft heap, and hard heap, a meldable priority queue
• scientific article; zbMATH DE number 6469130
• Rank-Pairing Heaps

Cited in

(4)

• Soft heaps simplified
• External memory soft heap, and hard heap, a meldable priority queue
• The soft heap
• Dynamic ordered sets with approximate queries, approximate heaps and soft heaps

This page was built for publication: A simpler implementation and analysis of Chazelle's soft heaps

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