%0 Book Section %1 Brodal:2013:PQ %A Brodal, Gerth Stølting %B Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday %D 2013 %E Brodnik, Andrej %E López-Ortiz, Alejandro %E Raman, Venkatesh %E Viola, Alfredo %I Springer %K Collections PriorityQueues Queues Survey %P 150--163 %R 10.1007/978-3-642-40273-9_11 %T A Survey on Priority Queues %V 8066 %X 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. %@ 978-3-642-40273-9

@incollection{Brodal:2013:PQ, abstract = {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.}, added-at = {2018-03-06T11:22:35.000+0100}, author = {Brodal, Gerth St{\o}lting}, biburl = {https://www.bibsonomy.org/bibtex/2727c4b62812575683fd4bfda6dc298af/gron}, booktitle = {Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday}, description = {A Survey on Priority Queues | SpringerLink}, doi = {10.1007/978-3-642-40273-9_11}, editor = {Brodnik, Andrej and López-Ortiz, Alejandro and Raman, Venkatesh and Viola, Alfredo}, interhash = {0d98cd2433bf80778749365f054e669e}, intrahash = {727c4b62812575683fd4bfda6dc298af}, isbn = {978-3-642-40273-9}, keywords = {Collections PriorityQueues Queues Survey}, pages = {150--163}, publisher = {Springer}, series = {LNCS}, timestamp = {2018-03-06T11:30:47.000+0100}, title = {{A Survey on Priority Queues}}, volume = 8066, year = 2013 }