On the limits of cache-oblivious rational permutations
From MaRDI portal
Publication:935473
DOI10.1016/j.tcs.2008.04.036zbMath1146.68054MaRDI QIDQ935473
Publication date: 6 August 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.036
lower bound; memory hierarchy; impossibility result; cache-oblivious algorithm; rational permutation; tall cache
Cites Work