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

Authors

94

  1. JŠ
    Janoš Šimon

    Pennsylvania State University, United States

    3 publications · 162 citations

    3

    h-index

  2. PC
    Pierluigi Crescenzi

    University of Florence, Italy

    2 publications · 28 citations

    2

    h-index

  3. WL
    Walter L. Ruzzo

    University of Washington, United States

    2 publications · 141 citations

    2

    h-index

  4. JG
    John Greiner

    Carnegie Mellon University, United States

    2 publications · 175 citations

    2

    h-index

  5. BG
    Bruce G. Lindsay

    Pennsylvania State University, United States

    2 publications · 288 citations

    2

    h-index

1–5 of 94

Venues

  1. Theoretical Computer Science

    4 publications · 103 citations

    4

    h-index

  2. SIAM Journal on Computing

    4 publications · 87 citations

    4

    h-index

  3. Journal of Computer and System Sciences

    3 publications · 196 citations

    3

    h-index

  4. ArXiv.org

    Repository · 2 publications · 26 citations

    2

    h-index

  5. Information and Control

    2 publications · 188 citations

    2

    h-index

1–5