An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
From MaRDI portal
Publication:5432366
DOI10.1137/S0097539703428324zbMath1147.68018MaRDI 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
68P05: Data structures
Related Items
Unnamed Item, Unnamed Item, Cache Oblivious Minimum Cut, On Cartesian trees and range minimum queries, Optimal cache-oblivious mesh layouts, Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies, Exploiting non-constant safe memory in resilient algorithms and data structures, A Survey on Priority Queues, On the Value of Multiple Read/Write Streams for Data Compression