External-memory priority queues with optimal insertions
From MaRDI portal
Cites work
- A data structure for manipulating priority queues
- A faster external memory priority queue with DecreaseKeys
- Algorithm Theory - SWAT 2004
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- Cache-oblivious algorithms
- Cache-oblivious algorithms
- DecreaseKeys are expensive for external memory priority queues
- External memory priority queues with decrease-key and applications to graph algorithms
- Fibonacci heaps and their uses in improved network optimization algorithms
- Heaps and heapsort on secondary storage
- scientific article; zbMATH DE number 4062572 (Why is no real title available?)
- scientific article; zbMATH DE number 1979501 (Why is no real title available?)
- scientific article; zbMATH DE number 2086641 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Implementation and Analysis of Binomial Queue Algorithms
- On RAM Priority Queues
- On the limits of cache-obliviousness
- Optimal Time Minimal Space Selection Algorithms
- Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday
- The buffer tree: A technique for designing batched external data structures
- The design of dynamic data structures
- Time bounds for selection
- Worst-case efficient external-memory priority queues
This page was built for publication: External-memory priority queues with optimal insertions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322391)
