Rank-Pairing Heaps

DOI10.1007/978-3-642-04128-0_59MaRDI QIDQ5902178zbMATH OpenOpenAlexFDO

Authors Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_59

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Rank-pairing heaps
• The pairing heap: A new form of self-adjusting heap
• On the efficiency of pairing heaps and related data structures
• Pairing heaps with costless meld
• scientific article; zbMATH DE number 1617246

Cited in

(14)

• Reflected min-Max heaps
• The pairing heap: A new form of self-adjusting heap
• Three priority queue applications revisited
• The weak-heap data structure: variants and applications
• Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract)
• Soft heaps simplified
• A linear potential function for pairing heaps
• Pairing heaps, scrambled pairing and square-root trees
• The violation heap: a relaxed Fibonacci-like heap
• On the efficiency of pairing heaps and related data structures
• The violation heap: a relaxed Fibonacci-like heap
• scientific article; zbMATH DE number 2050887 (Why is no real title available?)
• A simpler implementation and analysis of Chazelle's soft heaps
• Rank-pairing heaps

This page was built for publication: Rank-Pairing Heaps

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