Toward optimal self-adjusting heaps

DOI10.1145/3147138MaRDI QIDQ4554945zbMATH OpenOpenAlexFDO

Authors Amr Elmasry

Publication date 12 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3147138

zbMATH Keywords

amortized analysisheapspairing heapspriority queues

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Pairing heaps with costless meld
• Pairing heaps with O( n) decrease cost
• Self-Adjusting Heaps
• Parameterized self-adjusting heaps
• scientific article; zbMATH DE number 1617246

Cited in

(14)

• scientific article; zbMATH DE number 1617246 (Why is no real title available?)
• In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
• Pairing heaps with costless meld
• The soft heap
• scientific article; zbMATH DE number 1543353 (Why is no real title available?)
• Pairing heaps with O( n) decrease cost
• Self-Adjusting Heaps
• Parameterized self-adjusting heaps
• Smooth heaps and a dual view of self-adjusting data structures
• Why some heaps support constant-amortized-time decrease-key operations, and others do not
• Smooth heaps and a dual view of self-adjusting data structures
• Efficiency of self-adjusting heaps
• Strict Fibonacci heaps
• Analysis of smooth heaps and slim heaps

This page was built for publication: Toward optimal self-adjusting heaps

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