Towards a theory of cache-efficient algorithms

DOI10.1145/602220.602225zbMath1326.68374arXivcs/0010007OpenAlexW1979012070MaRDI QIDQ3455551

Neeraj Dumir, Siddhartha Chatterjee, Sandeep Sen

Publication date: 7 December 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0010007

zbMATH Keywords

lower boundhierarchical memoryI/O complexity

Mathematics Subject Classification ID

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

Related Items (4)

The cost of cache-oblivious searching ⋮ On the limits of cache-oblivious rational permutations ⋮ An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences

This page was built for publication: Towards a theory of cache-efficient algorithms