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

DOI10.1016/0020-0190(91)90218-7zbMath0714.68043OpenAlexW1968581474MaRDI QIDQ751283

Berry Schoenmakers, Anne Kaldewaij

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)

Related Items

A tight lower bound for top-down skew heaps, Amortized Complexity Verified, Optimal purely functional priority queues, Amortized complexity verified, A systematic analysis of splaying, A Survey on Priority Queues

Cites Work

• Unnamed Item
• The pairing heap: A new form of self-adjusting heap
• A tight amortized bound for path reversal
• Amortized Computational Complexity
• Self-adjusting binary search trees
• Self-Adjusting Heaps