On the hierarchy of distribution-sensitive properties for data structures
From MaRDI portal
Publication:2391860
Recommendations
Cites work
- scientific article; zbMATH DE number 1617246 (Why is no real title available?)
- scientific article; zbMATH DE number 2130678 (Why is no real title available?)
- scientific article; zbMATH DE number 1979501 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- A unified access bound on comparison-based dynamic dictionaries
- A unifying property for distribution-sensitive priority queues
- Fishspear: a priority queue algorithm
- 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
- Sequential access in splay trees takes linear time
This page was built for publication: On the hierarchy of distribution-sensitive properties for data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391860)