In recent years a large number of problems have been considered in external memory models of computation, where the complexity measure is the number of blocks of data that are moved between slow external memory and fast internal memory (also called I/Os). In practice, however, internal memory time often dominates the total running time once I/O-efficiency has been obtained. In this paper we study algorithms for fundamental problems that are simultaneously I/O-efficient and internal memory efficient in the RAM model of computation. © 2013 Springer-Verlag.
CITATION STYLE
Arge, L., & Thorup, M. (2013). RAM-efficient external memory sorting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 491–501). https://doi.org/10.1007/978-3-642-45030-3_46
Mendeley helps you to discover research relevant for your work.