Rank-pairing heaps

DOI10.1137/100785351MaRDI QIDQ5895541zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan

Publication date 15 March 2012

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0e16d77aa805d4ee2dd232167d46a8d375f345ca

zbMATH Keywords

algorithmamortized analysisdata structurepriority queuerank-pairing heap

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Rank-Pairing Heaps
• On the efficiency of pairing heaps and related data structures
• The pairing heap: A new form of self-adjusting heap
• Pairing heaps with costless meld
• Pairing heaps with O( n) decrease cost

Cited in

(15)

• Reflected min-Max heaps
• The pairing heap: A new form of self-adjusting heap
• Quake heaps: a simple alternative to Fibonacci heaps
• A survey on priority queues
• A linear potential function for pairing heaps
• Pairing heaps, scrambled pairing and square-root trees
• On the efficiency of pairing heaps and related data structures
• Hollow Heaps
• Replacing mark bits with randomness in Fibonacci heaps
• scientific article; zbMATH DE number 2050887 (Why is no real title available?)
• Pairing heaps: the forward variant
• Smooth heaps and a dual view of self-adjusting data structures
• Rank-Pairing Heaps
• Amortized complexity verified
• Strict Fibonacci 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 Q5895541)