The derivation of a tighter bound for top-down skew heaps

DOI10.1016/0020-0190(91)90218-7MaRDI QIDQ751283zbMATH OpenOpenAlexFDO

Authors Anne Kaldewaij, Berry Schoenmakers

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90218-7

zbMATH Keywords

analysis of algorithmsamortized complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A tight lower bound for top-down skew heaps
• A Note on Bottom-Up Skew Heaps
• A lower bound for the worst case of bottom-up-heapsort
• scientific article; zbMATH DE number 1617246
• Kinetic heap-ordered trees: Tight analysis and improved algorithms
• Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
• A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
• Practical approximation algorithms for zero- and bounded-skew trees
• Practical approximation algorithms for zero- and bounded-skew trees

Cites work

• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• A tight amortized bound for path reversal
• Amortized Computational Complexity
• Self-Adjusting Heaps
• Self-adjusting binary search trees
• The pairing heap: A new form of self-adjusting heap

Cited in

(8)

• A Note on Bottom-Up Skew Heaps
• A systematic analysis of splaying
• Two skew-binary numeral systems and one application
• A tight lower bound for top-down skew heaps
• Amortized complexity verified
• Optimal purely functional priority queues
• Amortized complexity verified
• A survey on priority queues

This page was built for publication: The derivation of a tighter bound for top-down skew heaps

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