You are here:
» A Survey on Priority Queues
About Aarhus University
A Survey on Priority Queues
Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review
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 language | English |
|---|---|
| Title of host publication | Space-Efficient Data Structures, Streams, and Algorithms : Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday |
| Editors | Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman , Alfredo Viola |
| Number of pages | 14 |
| Publisher | Springer VS |
| Publication year | 2013 |
| Pages | 150-163 |
| ISBN (print) | 978-3-642-40272-2 |
| ISBN (Electronic) | 978-3-642-40273-9 |
| DOIs | |
| Publication status | Published - 2013 |
See relations at Aarhus University Citationformats
Download statistics
No data available
ID: 68610067