A pointer-free data structure for merging heaps and min-max heaps
From MaRDI portal
Publication:1177934
DOI10.1016/0304-3975(91)90262-ZzbMath0739.68023WikidataQ126352146 ScholiaQ126352146MaRDI QIDQ1177934
Maurizio Talamo, Giorgio Gambosi, Enrico Nardelli
Publication date: 26 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
An efficient implicit data structure for relation testing and searching in partially ordered sets ⋮ Probabilistic data structures for priority queues ⋮ The K-D heap: An efficient multi-dimensional priority queue ⋮ The relaxed min-max heap: A mergeable double-ended priority queue
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Recursively rotated orders and implicit data structures: A lower bound
- An algorithm for merging heaps
- Partial match retrieval in implicit data structures
- Implicit data structures for fast search and update
- Efficient searching using partial ordering
- On the computational power of pushdown automata
- Amortized Computational Complexity
- Min-max heaps and generalized priority queues
- Implicit Data Structures for the Dictionary Problem
- Finding Minimum Spanning Trees
- A data structure for manipulating priority queues
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: A pointer-free data structure for merging heaps and min-max heaps
