Rank-Sensitive Priority Queues

Authors:
Brian C. Dean;Zachary H. Jones
Affiliations:
School of Computing, Clemson University, Clemson, USA;School of Computing, Clemson University, Clemson, USA
Venue:
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Year:
2009

Citing 9
Cited 0

Self-adjusting binary search trees

Journal of the ACM (JACM)
Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Fishspear: a priority queue algorithm

Journal of the ACM (JACM)
Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
Scapegoat trees

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences

SIAM Journal on Computing
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof

SIAM Journal on Computing
A unified access bound on comparison-based dynamic dictionaries

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the rank-sensitive priority queue -- a data structure that always knows the minimum element it contains, for which insertion and deletion take O (log(n /r )) time, with n being the number of elements in the structure, and r being the rank of the element being inserted or deleted (r = 1 for the minimum, r = n for the maximum). We show how several elegant implementations of rank-sensitive priority queues can be obtained by applying novel modifications to treaps and amortized balanced binary search trees, and we show that in the comparison model, the bounds above are essentially the best possible. Finally, we conclude with a case study on the use of rank-sensitive priority queues for shortest path computation.