Cache-oblivious algorithms and data structures

DOI10.1007/978-3-540-27810-8_2MaRDI QIDQ5315374zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General topics in the theory of algorithms (68W01)

Recommendations

• Cache-oblivious algorithms
• Cache-Oblivious B-Trees
• Cache-oblivious algorithms
• Cache-adaptive algorithms
• Towards a theory of cache-efficient algorithms

Cited in

(10)

• Cache oblivious matrix multiplication using an element ordering based on a Peano curve
• Cache and I/O efficent functional algorithms
• Towards a theory of cache-efficient algorithms
• Cache-oblivious algorithms
• I/O-efficient algorithms for CDBs
• Exponential structures for efficient cache-oblivious algorithms
• Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
• Cache-oblivious R-trees
• The cache complexity of multithreaded cache oblivious algorithms
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection

This page was built for publication: Cache-oblivious algorithms and data structures

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