publisher = {ACM},
address = {New York, NY, USA},
}
+
+@inproceedings{ thorup:queue,
+ title={{Integer priority queues with decrease key in constant time and the single source shortest paths problem}},
+ author={Thorup, M.},
+ booktitle={Proceedings of the thirty-fifth annual ACM symposium on Theory of computing},
+ pages={149--158},
+ year={2003},
+}
+
+@article{ thorup:equiv,
+ title={{Equivalence between priority queues and sorting}},
+ author={Thorup, M.},
+ journal={Journal of the ACM},
+ volume={54},
+ number={6},
+ pages={28},
+ year={2007},
+ publisher={ACM}
+}
+
+@conference{ cherkassky:hotq,
+ title={{Buckets, heaps, lists, and monotone priority queues}},
+ author={Cherkassky, B.V. and Goldberg, A.V. and Silverstein, C.},
+ booktitle={Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms},
+ pages={83--92},
+ year={1997},
+ organization={Society for Industrial and Applied Mathematics}
+}