Time-space Tradeoffs

Time-Space Tradeoffs is a theoretical construct in computational complexity theory that characterizes the inverse relationship between the time and space resources required by algorithms to solve computational problems, where reducing one resource necessitates an increase in the other.

125

Publications

4.7K

Citations

225

Authors

113

Institutions

Publications per year

2017–2026

11

Authors

225

  1. PB
    Paul Beame

    University of Washington, United States

    10 publications · 331 citations

    10

    h-index

  2. MT
    Martin Tompa

    University of Washington, United States

    4 publications · 146 citations

    4

    h-index

  3. RE
    Robert E. Tarjan

    Princeton University, United States

    3 publications · 177 citations

    3

    h-index

  4. MS
    Michael Saks

    Rutgers, The State University of New Jersey, United States

    3 publications · 132 citations

    3

    h-index

  5. PR
    Prabhakar Raghavan

    IBM Research - Almaden, United States

    3 publications · 65 citations

    3

    h-index

1–5 of 225

Venues

  1. SIAM Journal on Computing

    8 publications · 281 citations

    8

    h-index

  2. Journal of Computer and System Sciences

    6 publications · 263 citations

    6

    h-index

  3. Journal of the ACM

    JACM · 5 publications · 163 citations

    5

    h-index

  4. arXiv (Cornell University)

    Repository · 4 publications · 111 citations

    4

    h-index

  5. Information Processing Letters

    3 publications · 65 citations

    3

    h-index

1–5