A priority queue with the time-finger property
From MaRDI portal
Publication:1932364
DOI10.1016/j.jda.2012.04.014zbMath1257.68061MaRDI QIDQ1932364
John Iacono, Amr Elmasry, Arash Farzan
Publication date: 18 January 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.04.014
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Sequential access in splay trees takes linear time
- The pairing heap: A new form of self-adjusting heap
- Queaps
- On the sequential access theorem and deque conjecture for splay trees
- A unified access bound on comparison-based dynamic dictionaries
- Self‐adjusting trees in practice for large text collections
- Worst-Case Optimal Priority Queues via Extended Regular Counters
- A Unifying Property for Distribution-Sensitive Priority Queues
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- Meldable heaps and boolean union-find
- Self-adjusting binary search trees
- A data structure for manipulating priority queues
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof