On RAM priority queues
@article{Thorup1996OnRP, title={On RAM priority queues}, author={M. Thorup}, journal={SIAM J. Comput.}, year={1996}, volume={30}, pages={86-109} }
Priority queues are some of the most fundamental data structures. [...] Key Result Plugging this priority queue into Dijkstra's algorithm gives an O(mlog log m) algorithm for the single source shortest path problem on a graph with m edges, as compared with the previous $O(m\sqrt{\log m})$ bound based on Fredman and Willard's priority queue. The above bounds assume $O(n 2^{{\varepsilon} w})$ space, where w is the word length and ${\varepsilon}>0$. They can, however, be achieved in linear space using randomized…Expand Abstract
Topics from this paper
169 Citations
An Experimental Study of Priority Queues in External Memory
- Computer Science
- Algorithm Engineering
- 1999
- 24
Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Mathematics, Computer Science
- J. Comput. Syst. Sci.
- 2004
- 52
Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Mathematics, Computer Science
- STOC '03
- 2003
- 90
- PDF
Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem
- Mathematics, Computer Science
- COCOA
- 2009
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- Mathematics, Computer Science
- Computing
- 2010
- 1
- PDF
Equivalence between priority queues and sorting
- Computer Science
- The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
- 2002
- 9
References
SHOWING 1-2 OF 2 REFERENCES
Faster algorithms for the shortest path problem
- Mathematics, Computer Science
- JACM
- 1990
- 494
- Highly Influential
- PDF
astad, Optimal bounds on the decision problems on the CRCW PRAM
- J. ACM
- 1989