Hollow Heaps

DOI10.1007/978-3-662-47672-7_56zbMath1440.68050arXiv1510.06535OpenAlexW3037094428WikidataQ60299129 ScholiaQ60299129MaRDI QIDQ3448827

Thomas Dueholm Hansen, Uri Zwick, Haim Kaplan, Robert Endre Tarjan

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.06535

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Smooth Heaps and a Dual View of Self-Adjusting Data Structures

Cites Work

• A note on two problems in connexion with graphs
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Theory of 2-3 heaps
• Quake Heaps: A Simple Alternative to Fibonacci Heaps
• THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP
• Meldable heaps and boolean union-find
• Thin heaps, thick heaps
• Fibonacci heaps and their uses in improved network optimization algorithms
• Strict fibonacci heaps
• Optimum branchings
• Rank-Pairing Heaps
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hollow Heaps