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.
Lecture Notes in Computer Science: 24th International Symposium, Isaac 2013, Hong Kong, China, December 16-18, 2013, Proceedings, 2013, p. 491-501
Main Research Area:
Lecture Notes in Computer Science
International Symposium on Algorithms and ComputationInternational Symposium on Algorithms and Computation, 2013