Pairing heaps with costless meld

DOI10.1007/978-3-642-15781-3_16MaRDI QIDQ3586394zbMATH OpenOpenAlexFDO

Authors Amr Elmasry

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15781-3_16

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Toward optimal self-adjusting heaps
• Pairing heaps with O( n) decrease cost
• scientific article; zbMATH DE number 1617246
• On the efficiency of pairing heaps and related data structures
• The pairing heap: A new form of self-adjusting heap

Cited in

(12)

• The pairing heap: A new form of self-adjusting heap
• scientific article; zbMATH DE number 1617246 (Why is no real title available?)
• A survey on priority queues
• A linear potential function for pairing heaps
• On the efficiency of pairing heaps and related data structures
• Toward optimal self-adjusting heaps
• Pairing heaps with O( n) decrease cost
• Bipartite binomial heaps
• Pairing heaps: the forward variant
• Algorithm Theory - SWAT 2004
• Rank-pairing heaps
• Rank-Pairing Heaps

This page was built for publication: Pairing heaps with costless meld

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