On the limits of cache-obliviousness

DOI10.1145/780542.780589MaRDI QIDQ3581248zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Rolf Fagerberg

Publication date 16 August 2010

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

Full work available at URL https://doi.org/10.1145/780542.780589

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Computer system organization (68M99)

Recommendations

• scientific article; zbMATH DE number 2011837
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1445384
• Engineering a cache-oblivious sorting algorithm
• On the limits of cache-oblivious rational permutations

Cited in

(19)

• On sorting, heaps, and minimum spanning trees
• The cache complexity of multithreaded cache oblivious algorithms
• scientific article; zbMATH DE number 2011837 (Why is no real title available?)
• scientific article; zbMATH DE number 1445384 (Why is no real title available?)
• Towards a theory of cache-efficient algorithms
• Engineering a cache-oblivious sorting algorithm
• Cache oblivious minimum cut
• Near-optimal online multiselection in internal and external memory
• Cache-oblivious and data-oblivious sorting and applications
• Cache-oblivious algorithms
• Optimal sparse matrix dense vector multiplication in the I/O-model
• On the Limits of Cache-Oblivious Matrix Transposition
• Cache-oblivious hashing
• Cache-oblivious range reporting with optimal queries requires superlinear space
• Proximity MergeSort, optimal in-place sorting in the cache-oblivious model
• Deterministic cache-oblivious funnelselect
• Permuting and batched geometric lower bounds in the I/O model
• External memory fully persistent search trees
• On the limits of cache-oblivious rational permutations

This page was built for publication: On the limits of cache-obliviousness

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