Layered heaps
From MaRDI portal
Recommendations
Cited in
(15)- A survey on priority queues
- scientific article; zbMATH DE number 4014031 (Why is no real title available?)
- An in-place priority queue with O(1) time for push and n + O(1) comparisons for pop
- Piled-Slab Searches
- Hollow Heaps
- Heaps on Heaps
- A Note on Bottom-Up Skew Heaps
- Building heaps fast
- Thin heaps, thick heaps
- Multipartite priority queues
- The amortized cost of finding the minimum
- Two-Tier Relaxed Heaps
- Refined complexity analysis for heap operations
- Strict Fibonacci heaps
- An optimal algorithm for deleting the root of a heap
This page was built for publication: Layered heaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315373)