On the efficiency of pairing heaps and related data structures

DOI10.1145/320211.320214MaRDI QIDQ3158546zbMATH OpenOpenAlexWikidataFDO

Authors Michael L. Fredman

Publication date 25 January 2005

Published in Journal of the ACM (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• The pairing heap: A new form of self-adjusting heap
• Rank-Pairing Heaps
• Rank-pairing heaps
• Pairing heaps with costless meld
• Pairing heaps with O( n) decrease cost

Cited in

(24)

• The number of tests required to search an unordered table
• The pairing heap: A new form of self-adjusting heap
• Three priority queue applications revisited
• Efficient management of dynamic tables
• A note on constructing binary heaps with periodic networks.
• The weak-heap data structure: variants and applications
• scientific article; zbMATH DE number 1617246 (Why is no real title available?)
• A survey on priority queues
• A linear potential function for pairing heaps
• The violation heap: a relaxed Fibonacci-like heap
• Replacing mark bits with randomness in Fibonacci heaps
• Pairing heaps with costless meld
• scientific article; zbMATH DE number 17818 (Why is no real title available?)
• scientific article; zbMATH DE number 2050887 (Why is no real title available?)
• Pairing heaps with O( n) decrease cost
• Pairing heaps: the forward variant
• Improved bounds for multipass pairing heaps and path-balanced binary search trees
• Smooth heaps and a dual view of self-adjusting data structures
• Rank-pairing heaps
• Rank-Pairing Heaps
• Efficiency of self-adjusting heaps
• Strict Fibonacci heaps
• Analysis of smooth heaps and slim heaps
• Two-tier relaxed heaps

This page was built for publication: On the efficiency of pairing heaps and related data structures

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