A Survey on Priority Queues
Gerth Stølting Brodal · Lecture notes in computer science · 2013
Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin 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. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.