Publisher
Springer Berlin Heidelberg
Reference37 articles.
1. Adams MD, Wise DS (2006) Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms. In: Proceedings of the 2006 workshop on memory system performance and correctness, San Jose, pp 41–50
2. Afshani P, Zeh N (2011) Improved space bounds for cache-oblivious range reporting. In: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, San Francisco, pp 1745–1758
3. Aggarwal A, Vitter JS (1988) The Input/Output complexity of sorting and related problems. Commun ACM 31(9):1116–1127
4. Allulli L, Lichodzijewski P, Zeh N (2007) A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, New Orleans, pp 910–919
5. Arge L (2002) External memory data structures. In: Abello J, Pardalos PM, Resende MGC (eds) Handbook of massive data sets. Kluwer Academic, Dordrecht/Boston/London, pp 313–358