THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP

DOI10.1142/S1793830910000838zbMath1211.68128OpenAlexW2040934527MaRDI QIDQ3084682

Amr Elmasry

Publication date: 25 March 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000838

zbMATH Keywords

data structurespriority queuesFibonacci heapsamortized analysis decrease key

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Algorithms in computer science (68W99)

Related Items (5)

Hollow Heaps ⋮ Replacing Mark Bits with Randomness in Fibonacci Heaps ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Pairing heaps: the forward variant. ⋮ Quake Heaps: A Simple Alternative to Fibonacci Heaps

Cites Work

• Unnamed Item
• Two-tier relaxed heaps
• The pairing heap: A new form of self-adjusting heap
• Theory of 2-3 heaps
• On the efficiency of pairing heaps and related data structures
• Self-adjusting binary search trees
• A data structure for manipulating priority queues

This page was built for publication: THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP