scientific article; zbMATH DE number 871899
From MaRDI portal
Publication:4875168
Recommendations
Cited in
(42)- Reflected min-Max heaps
- Worst-case data structures for the priority queue with attrition
- A priority queue with the time-finger property
- Regular numeral systems for data structures
- Quantum algorithm for shortest path search in directed acyclic graph
- Worst case constant time priority queue
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- A survey on priority queues
- Dynamically maintaining shortest path trees under batches of updates
- Worst-case optimal priority queues via extended regular counters
- Black box for constant-time insertion in priority queues (note)
- A unifying property for distribution-sensitive priority queues
- Rank-Sensitive Priority Queues
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- Hollow Heaps
- Strictly implicit priority queues: on the number of moves and worst-case time
- Hash functions for priority queues
- scientific article; zbMATH DE number 4062572 (Why is no real title available?)
- scientific article; zbMATH DE number 1305509 (Why is no real title available?)
- Fishspear: a priority queue algorithm
- scientific article; zbMATH DE number 1979501 (Why is no real title available?)
- scientific article; zbMATH DE number 2065978 (Why is no real title available?)
- scientific article; zbMATH DE number 1476490 (Why is no real title available?)
- DecreaseKeys are expensive for external memory priority queues
- Priority queues on parallel machines
- Probabilistic data structures for priority queues
- Fast meldable priority queues
- A Back-to-Basics Empirical Study of Priority Queues
- Algorithm Theory - SWAT 2004
- Algorithm Theory - SWAT 2004
- Algorithms and Data Structures
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Cascade heap: towards time-optimal extractions
- Cascade heap: towards time-optimal extractions
- Privacy-preserving Dijkstra
- A generalization of binomial queues
- Strict Fibonacci heaps
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Two new methods for constructing double-ended priority queues from priority queues
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
- Priority queueing involving orientation and the problems of their software implementation
- Two-tier relaxed heaps
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875168)
