Deterministic Space Complexity

Deterministic Space Complexity is the measure of the minimum amount of memory space required by a deterministic Turing machine to solve a computational problem as a function of the input size.

23

Publications

912

Citations

54

Authors

44

Institutions

Publications per year

2017–2026

1

Authors

54

  1. MT
    Mikkel Thorup

    AT&T (United States), United States

    2 publications · 71 citations

    2

    h-index

  2. VG
    Viliam Geffert

    University of Pavol Jozef Šafárik, Slovakia

    2 publications · 63 citations

    2

    h-index

  3. RM
    Ryu Mizoguchi

    Kyushu University, Japan

    1 publications · 23 citations

    1

    h-index

  4. YK
    Yukiko Kenmochi⋆

    Université Gustave Eiffel, France

    1 publications · 18 citations

    1

    h-index

  5. AS
    Akihiro Sugimoto

    National Institute of Informatics, Japan

    1 publications · 18 citations

    1

    h-index

1–5 of 54

Venues

  1. Theoretical Computer Science

    3 publications · 75 citations

    3

    h-index

  2. SIAM Journal on Computing

    2 publications · 61 citations

    2

    h-index

  3. Journal of the ACM

    JACM · 1 publications · 41 citations

    1

    h-index

  4. Information Processing Letters

    1 publications · 16 citations

    1

    h-index

  5. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 1 publications · 66 citations

    1

    h-index

1–5