Recommendations
Cites work
- scientific article; zbMATH DE number 4062572 (Why is no real title available?)
- scientific article; zbMATH DE number 88943 (Why is no real title available?)
- A data structure for manipulating priority queues
- Amortized Computational Complexity
- Fibonacci heaps and their uses in improved network optimization algorithms
- Fishspear: a priority queue algorithm
- Min-max heaps and generalized priority queues
- The pairing heap: A new form of self-adjusting heap
- The relaxed min-max heap: A mergeable double-ended priority queue
Cited in
(23)- Fishspear: a priority queue algorithm
- Range-restricted mergeable priority queues
- scientific article; zbMATH DE number 1979501 (Why is no real title available?)
- The randomized complexity of maintaining the minimum
- Reflected min-Max heaps
- Parallel priority queues based on binomial heaps
- Multidimensional heaps and complementary range searching
- Rank-Sensitive Priority Queues
- Priority queues on parallel machines
- Strictly-regular number system and data structures
- Algorithm Theory - SWAT 2004
- Regular numeral systems for data structures
- Queue-mergesort
- Bipartite binomial heaps
- Worst-case optimal priority queues via extended regular counters
- scientific article; zbMATH DE number 6469130 (Why is no real title available?)
- Twol-amalgamated priority queues
- Probabilistic data structures for priority queues
- A simple implementation technique for priority search queues
- Optimal purely functional priority queues
- Melding priority queues
- A generalization of binomial queues
- Strict Fibonacci heaps
This page was built for publication: Fast meldable priority queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057442)
