A priority queue with the time-finger property
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1617246 (Why is no real title available?)
- scientific article; zbMATH DE number 1979501 (Why is no real title available?)
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- A data structure for manipulating priority queues
- A unified access bound on comparison-based dynamic dictionaries
- A unifying property for distribution-sensitive priority queues
- Meldable heaps and boolean union-find
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- On the sequential access theorem and deque conjecture for splay trees
- Queaps
- Self-adjusting binary search trees
- Self-adjusting trees in preactice for large text collections
- Sequential access in splay trees takes linear time
- The pairing heap: A new form of self-adjusting heap
- Worst-case optimal priority queues via extended regular counters
Cited in
(8)- scientific article; zbMATH DE number 1979500 (Why is no real title available?)
- Queaps
- scientific article; zbMATH DE number 2081024 (Why is no real title available?)
- A unifying property for distribution-sensitive priority queues
- Polylogarithmic fully retroactive priority queues via hierarchical checkpointing
- Smooth heaps and a dual view of self-adjusting data structures
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- A survey on priority queues
This page was built for publication: A priority queue with the time-finger property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932364)