Worst-case efficient external-memory priority queues
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3841211 (Why is no real title available?)
- scientific article; zbMATH DE number 4062572 (Why is no real title available?)
- scientific article; zbMATH DE number 3653523 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1476487 (Why is no real title available?)
- scientific article; zbMATH DE number 1559569 (Why is no real title available?)
- scientific article; zbMATH DE number 767429 (Why is no real title available?)
- scientific article; zbMATH DE number 871900 (Why is no real title available?)
- A data structure for manipulating priority queues
- Algorithms for parallel memory, I: Two-level memories
- Fishspear: a priority queue algorithm
- Heaps and heapsort on secondary storage
- Implementation and Analysis of Binomial Queue Algorithms
- Irredundant intervals
- Organization and maintenance of large ordered indexes
- The buffer tree: A new technique for optimal I/O-algorithms
- The parallel hierarchical memory model
Cited in
(20)- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- scientific article; zbMATH DE number 2111732 (Why is no real title available?)
- Algorithms and Data Structures
- An experimental study of priority queues in external memory
- External memory soft heap, and hard heap, a meldable priority queue
- I/O-efficient 2-d orthogonal range skyline and attrition priority queues
- scientific article; zbMATH DE number 1979501 (Why is no real title available?)
- DecreaseKeys are expensive for external memory priority queues
- A faster external memory priority queue with DecreaseKeys
- scientific article; zbMATH DE number 1476490 (Why is no real title available?)
- Hash functions for priority queues
- Ordered priority queues
- On RAM Priority Queues
- Revisiting priority queues for image analysis
- A simple implementation technique for priority search queues
- Fast priority queues for cached memory
- The complexity of flow on fat terrains and its i/o-efficient computation
- The I/O complexity of computing prime tables
- Worst case constant time priority queue
- Equivalence between priority queues and sorting in external memory
This page was built for publication: Worst-case efficient external-memory priority queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054847)