Thin heaps, thick heaps

DOI10.1145/1328911.1328914zbMath1446.68042OpenAlexW1978960961MaRDI QIDQ4962695

Haim Kaplan, Robert Endre Tarjan

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1328911.1328914

zbMATH Keywords

priority queueheapdata structureFibonacci heapbinomial queuedecrease key operationmeldingthick heapthin heap

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (6)

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 ⋮ A Survey on Priority Queues

This page was built for publication: Thin heaps, thick heaps