Cache-oblivious priority queue and graph algorithm applications

DOI10.1145/509907.509950MaRDI QIDQ3579229zbMATH OpenOpenAlexFDO

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

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.2587

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Programming involving graphs or networks (90C35)

Cited in

(7)

• Cache-oblivious R-trees
• Remote memory references at block granularity
• Cache-oblivious iterated predecessor queries via range coalescing
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• Designing reliable algorithms in unreliable memories
• Optimal offline ORAM with perfect security via simple oblivious priority queues
• New method in information processing for maintaining an efficient dynamic ordered set

This page was built for publication: Cache-oblivious priority queue and graph algorithm applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579229)