Fast priority queues for cached memory
From MaRDI portal
Recommendations
Cited in
(19)- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- An experimental study of priority queues in external memory
- Producing proofs of unsatisfiability with distributed clause-sharing SAT solvers
- The d-deap\(^*\): a fast and simple cache-aligned d-ary deap
- Randomized priority queues for fast parallel access
- On sorting, heaps, and minimum spanning trees
- scientific article; zbMATH DE number 1979501 (Why is no real title available?)
- Inducing suffix and LCP arrays in external memory
- I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
- scientific article; zbMATH DE number 6469188 (Why is no real title available?)
- Balanced allocation and dictionaries with tightly packed constant size bins
- Irredundant intervals
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- Analysis of smooth heaps and slim heaps
- Priority queues with decreasing keys
- On RAM Priority Queues
- Engineering parallel string sorting
- CBPQ: high performance lock-free priority queue
- A survey on priority queues
This page was built for publication: Fast priority queues for cached memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463402)
