Reference Work Entry

Encyclopedia of Algorithms

pp 1260-1264


Memory-Constrained Algorithms

  • Matias KormanAffiliated withGraduate School of Information Sciences, Tohoku University Email author 


Connectivity Constant workspace Logspace Multi-pass algorithms One-pass algorithms Selection Sorting Stack algorithms Streaming Time-space trade-off Undirected graphs

Years and Authors of Summarized Original Work

  • 1980; Munro, Patterson

  • 2000; Reingold

  • 2013; Barba, Korman, Langerman, Sadakane, Silveira

Problem Definition

This field of research evolves around the design of algorithms in the presence of memory constraints. Research on this topic has been going on for over 40 years [16]. Initially, this was motivated by the high cost of memory space. Afterward, the topic received a renewed interest with appearance of smartphones and other types of handheld devices for which large amounts of memory are either expensive or not desirable.

Although many variations of this principle exist, the general idea is the same: the input is in some kind of read-only data structure, the output must be given in a write-only structure, and in addition to these two structures, we can only use a fixed amount of memory to compute the solution. This memory should be enough to cover all space requirements of the algorithm (including the variables directly used by the algorithm, spa ...

This is an excerpt from the content