On the limits of cache-obliviousness

DOI10.1145/780542.780589zbMath1192.68193OpenAlexW2034413563MaRDI QIDQ3581248

Rolf Fagerberg, Gerth Stølting Brodal

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)

Related Items (8)

Cache Oblivious Minimum Cut ⋮ Near-optimal online multiselection in internal and external memory ⋮ Optimal sparse matrix dense vector multiplication in the I/O-model ⋮ Cache-oblivious hashing ⋮ On the limits of cache-oblivious rational permutations ⋮ Cache-oblivious range reporting with optimal queries requires superlinear space ⋮ On sorting, heaps, and minimum spanning trees ⋮ On the Limits of Cache-Oblivious Matrix Transposition

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