A Survey on Priority Queues [chapter]

Gerth Stølting Brodal
2013 Lecture Notes in Computer Science  
Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and Ex-tractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority queues has taken the last 50 years. Center for Massive Data Algorithms, a Center of the Danish National Research Foundation. 1 We let lg x denote the binary logarithm of x. 2 In the following we denote a
more » ... data structure storing O(1) words of lg n bits between the operations also as being implicit. The additional space will be stated explicitly in these cases.
doi:10.1007/978-3-642-40273-9_11 fatcat:zocxhiyfmvdgzn2yoob25h3wr4