Aarhus University Seal

A Survey on Priority Queues

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review


  • C313

    246 KB, PDF document


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.
Original languageEnglish
Title of host publicationSpace-Efficient Data Structures, Streams, and Algorithms : Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday
EditorsAndrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman , Alfredo Viola
Number of pages14
PublisherSpringer VS
Publication year2013
Pages 150-163
ISBN (print)978-3-642-40272-2
ISBN (Electronic)978-3-642-40273-9
Publication statusPublished - 2013

See relations at Aarhus University Citationformats

Download statistics

No data available

ID: 68610067