A tight lower bound for top-down skew heaps

DOI10.1016/S0020-0190(97)00028-8zbMATH Open1336.68050OpenAlexW2129549945MaRDI QIDQ287017FDOQ287017

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

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
• 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

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)

Cites Work

• Title not available (Why is that?)
• Efficiency of a Good But Not Linear Set Union Algorithm
• Worst-case Analysis of Set Union Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-Adjusting Heaps
• Title not available (Why is that?)
• Efficiency of Equivalence Algorithms
• The derivation of a tighter bound for top-down skew heaps

Cited In (2)

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

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)