On the limits of cache-oblivious rational permutations

Francesco Silvestri. On the limits of cache-oblivious rational permutations. Theoretical Computer Science, 402(2-3):221-233, 2008. [doi]

@article{Silvestri08,
  title = {On the limits of cache-oblivious rational permutations},
  author = {Francesco Silvestri},
  year = {2008},
  doi = {10.1016/j.tcs.2008.04.036},
  url = {http://dx.doi.org/10.1016/j.tcs.2008.04.036},
  tags = {caching},
  researchr = {https://researchr.org/publication/Silvestri08},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {402},
  number = {2-3},
  pages = {221-233},
}