Space-bounded Computation
Space-Bounded Computation is a computational process in which the amount of memory space used by an algorithm is restricted by a function of the input size, typically expressed as a bound on the number of tape cells used by a Turing machine during its execution.
54
Publications
3.8K
Citations
94
Authors
61
Institutions
Publications per year
2017–2026
2
Parents
54
Space-efficient online computation of quantile summaries
Michael B. Greenwald, Sanjeev Khanna · 2001 · 456 citations
Pseudorandom generators for space-bounded computation
Noam Nisan · COMBINATORICA · 1992 · 427 citations
Pseudorandom generators for space-bounded computations
Noam Nisan · 1990 · 229 citations
1–5 of 54
94
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 94
61
IBM Research - Almaden
San Jose, United States
5 h-index
9 publications
1K citations
Princeton University
Princeton, United States
3 h-index
6 publications
126 citations

University of Waterloo
Waterloo, Canada
3 h-index
3 publications
111 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
289 citations
IBM (United States)
Armonk, United States
3 h-index
6 publications
885 citations
University of Washington
Seattle, United States
3 h-index
5 publications
321 citations

Pennsylvania State University
State College, United States
3 h-index
4 publications
183 citations

University of Edinburgh
Edinburgh, United Kingdom
2 h-index
3 publications
228 citations
1–8 of 61
4 publications · 103 citations
4
h-index
4 publications · 87 citations
4
h-index
3 publications · 196 citations
3
h-index
Repository · 2 publications · 26 citations
2
h-index
2 publications · 188 citations
2
h-index
1–5