A tight lower bound for top-down skew heaps

DOI10.1016/S0020-0190(97)00028-8zbMath1336.68050OpenAlexW2129549945MaRDI QIDQ287017

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)

Related Items (1)

A Survey on Priority Queues

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The derivation of a tighter bound for top-down skew heaps
• Worst-case Analysis of Set Union Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• Self-Adjusting Heaps
• Efficiency of Equivalence Algorithms

This page was built for publication: A tight lower bound for top-down skew heaps