An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms

DOI10.1137/S0097539703428324zbMath1147.68018OpenAlexW2063354603MaRDI QIDQ5432366

Bryan Holland-Minkley, Lars Arge, J. Ian Munro, Erik D. Demaine, Michael A. Bender

Publication date: 3 January 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539703428324

zbMATH Keywords

priority queuecache-oblivious algorithms

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (9)

Cache Oblivious Minimum Cut ⋮ Unnamed Item ⋮ Optimal cache-oblivious mesh layouts ⋮ On Cartesian trees and range minimum queries ⋮ Unnamed Item ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies ⋮ On the Value of Multiple Read/Write Streams for Data Compression ⋮ A Survey on Priority Queues ⋮ Exploiting non-constant safe memory in resilient algorithms and data structures

This page was built for publication: An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms