• DOI:10.1137/S0097539795288246
Corpus ID: 5221089

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}
}

M. Thorup

Published 1996

Computer Science, Mathematics

SIAM J. Comput.

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

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed