Pairing heaps with O( n) decrease cost

MaRDI QIDQ4633856zbMATH OpenFDO

Authors Amr Elmasry

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496822

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Toward optimal self-adjusting heaps
• Pairing heaps with costless meld
• Why some heaps support constant-amortized-time decrease-key operations, and others do not
• On the efficiency of pairing heaps and related data structures
• Pairing heaps, scrambled pairing and square-root trees

Cited in

(12)

• scientific article; zbMATH DE number 1696652 (Why is no real title available?)
• An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons
• On the efficiency of pairing heaps and related data structures
• Pairing heaps with costless meld
• scientific article; zbMATH DE number 2050887 (Why is no real title available?)
• Toward optimal self-adjusting heaps
• Pairing heaps: the forward variant
• Why some heaps support constant-amortized-time decrease-key operations, and others do not
• Algorithm Theory - SWAT 2004
• Rank-pairing heaps
• Efficiency of self-adjusting heaps
• Strict Fibonacci heaps

This page was built for publication: Pairing heaps with \(O(\log \log n)\) decrease cost

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