Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics
Reference3 articles.
1. A. Aggarwal and J. S. Vitter, “The input/output complexity of sorting and related problems,” Commun. ACM, 31, 1116–1127 (1988).
2. R. W. Floyd, “Permuting information in idealized two-level storage,” in: R. Miller and J. Thatcher (editors), Complexity of Computer Calculations, Plenum, (1972), p. 105–109.
3. E. D. Demaine, Cache-Oblivious Algorithms and Data Structures, MIT Laboratory for Computer Science, Cambridge, MA (2002).