Rank-Sensitive Priority Queues

DOI10.1007/978-3-642-03367-4_16zbMath1253.68105OpenAlexW1533203897MaRDI QIDQ3183452

Zachary H. Jones, Brian C. Dean

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_16

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Queaps
• Shortest paths algorithms: Theory and experimental evaluation
• Randomized search trees
• A unified access bound on comparison-based dynamic dictionaries
• Faster algorithms for the shortest path problem
• Self-adjusting binary search trees
• Fishspear: a priority queue algorithm
• On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
• On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
• Unnamed Item
• Unnamed Item