Funnel heap -- a cache oblivious priority queue
From MaRDI portal
Recommendations
- Fast priority queues for cached memory
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- Parallel heap: an optimal parallel priority queue
- The K-D heap: An efficient multi-dimensional priority queue
- An efficient algorithm for concurrent priority queue heaps
- Fast meldable priority queues
- Worst-case efficient external-memory priority queues
- A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms
- Optimal purely functional priority queues
- scientific article; zbMATH DE number 871899
Cited in
(15)- Cache-oblivious R-trees
- A priority queue with the time-finger property
- Revisiting priority queues for image analysis
- On the hierarchy of distribution-sensitive properties for data structures
- A survey on priority queues
- Cache-oblivious iterated predecessor queries via range coalescing
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs
- Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- Fast priority queues for cached memory
- Cache-oblivious index for approximate string matching
- The cost of cache-oblivious searching
- External-memory priority queues with optimal insertions
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
This page was built for publication: Funnel heap -- a cache oblivious priority queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425956)