Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro. An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. SIAM Journal on Computing, 36(6):1672-1695, 2007. [doi]
@article{ArgeBDHM07,
title = {An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms},
author = {Lars Arge and Michael A. Bender and Erik D. Demaine and Bryan Holland-Minkley and J. Ian Munro},
year = {2007},
doi = {10.1137/S0097539703428324},
url = {http://dx.doi.org/10.1137/S0097539703428324},
tags = {caching, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ArgeBDHM07},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {36},
number = {6},
pages = {1672-1695},
}