Years and Authors of Summarized Original Work
1980; Munro, Patterson
2013; Barba, Korman, Langerman, Sadakane, Silveira
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 . 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...
KeywordsConnectivity Constant workspace Logspace Multi-pass algorithms One-pass algorithms Selection Sorting Stack algorithms Streaming Time-space trade-off Undirected graphs
- 1.Aleliunas R, Karp RM, Lipton R, Lovasz L, Rackoff C (1979) Random walks, universal traversal sequences, and the complexity of maze problems. In: FOCS, San Juan, pp 218–223Google Scholar
- 3.Asano T, Rote G (2009) Constant-working-space algorithms for geometric problems. In: CCCG, Vancouver, pp 87–90Google Scholar
- 10.Elmasry A, Juhl DD, Katajainen J, Satti SR (2013) Selection from read-only memory with limited workspace. In: COCOON, Hangzhou, pp 147–157Google Scholar
- 14.Nisan N, Szemeredi E, Wigderson A (1992) Undirected connectivity in o(l o g 1. 5 n) space. In: FOCS, Pittsburg, pp 24–29Google Scholar
- 15.Pagter J, Rauhe T (1998) Optimal time-space trade-offs for sorting. In: FOCS, Palo Alto, pp 264–268Google Scholar
- 16.Pohl I (1969) A minimum storage algorithm for computing the median. IBM technical report RC2701Google Scholar
- 17.Raman V, Ramnath S (1998) Improved upper bounds for time-space tradeoffs for selection with limited storage. In: SWAT ’98, Stockholm, pp 131–142Google Scholar