A tight lower bound for top-down skew heaps

DOI10.1016/S0020-0190(97)00028-8MaRDI QIDQ287017zbMATH OpenOpenAlexFDO

Authors Berry Schoenmakers

Publication date 26 May 2016

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

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00028-8

zbMATH Keywords

analysis of algorithmsamortized complexitymergeable priority queuesself-adjusting data structurestop-down skew heaps

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Recommendations

• The derivation of a tighter bound for top-down skew heaps
• A Note on Bottom-Up Skew Heaps
• A lower bound for the worst case of bottom-up-heapsort
• Bounds for min-max heaps
• scientific article; zbMATH DE number 1617246
• Practical approximation algorithms for zero- and bounded-skew trees
• Practical approximation algorithms for zero- and bounded-skew trees
• Near Optimal   Heap
• Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture

Cites work

• scientific article; zbMATH DE number 54254 (Why is no real title available?)
• scientific article; zbMATH DE number 1306897 (Why is no real title available?)
• scientific article; zbMATH DE number 1865733 (Why is no real title available?)
• scientific article; zbMATH DE number 758277 (Why is no real title available?)
• Efficiency of Equivalence Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• Self-Adjusting Heaps
• The derivation of a tighter bound for top-down skew heaps
• Worst-case Analysis of Set Union Algorithms

Cited in

(2)

• The derivation of a tighter bound for top-down skew heaps
• A survey on priority queues

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A tight lower 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 Q287017)