Optimal purely functional priority queues
From MaRDI portal
Recommendations
Cites work
- A data structure for manipulating priority queues
- An applicative random-access stack
- Confluently Persistent Deques via Data-Structural Bootstrapping
- Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
- Implementation and Analysis of Binomial Queue Algorithms
- Making data structures persistent
- Self-adjusting binary search trees
- Self-Adjusting Heaps
- The derivation of a tighter bound for top-down skew heaps
- The pairing heap: A new form of self-adjusting heap
Cited in
(11)- An explicit solution for the value function of a priority queue
- A survey on priority queues
- Purely functional, real-time deques with catenation
- Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function
- scientific article; zbMATH DE number 1979501 (Why is no real title available?)
- A simple implementation technique for priority search queues
- Space-efficient functional offline-partially-persistent trees with applications to planar point location
- Ranked enumeration for MSO on trees via knowledge compilation
- Two skew-binary numeral systems and one application
- Ranked enumeration of MSO logic on words
- Two-tier relaxed heaps
This page was built for publication: Optimal purely functional priority queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339017)
