Succinct Dynamic Data Structures

Succinct Dynamic Data Structures is a dynamic data structure that supports efficient updates and queries while using space close to the information-theoretic lower bound for the data it represents.

8

Publications

233

Citations

23

Authors

20

Institutions

Publications per year

2017–2026

2

Authors

23

  1. MS
    Micha Sharir

    Tel Aviv University, Israel

    2 publications · 76 citations

    2

    h-index

  2. JI
    J. Ian Munro

    University of Waterloo, Canada

    2 publications · 68 citations

    2

    h-index

  3. NR
    Nieves R. Brisaboa

    Universidade da Coruña, Spain

    1 publications · 21 citations

    1

    h-index

  4. YD
    Yuefeng Du

    City University of Hong Kong, Hong Kong SAR China

    1 publications · 31 citations

    1

    h-index

  5. GN
    Gonzalo Navarro

    University of Chile, Chile

    1 publications · 21 citations

    1

    h-index

1–5 of 23

Venues

  1. Computational Geometry

    2 publications · 76 citations

    2

    h-index

  2. Theoretical Computer Science

    1 publications · 19 citations

    1

    h-index

  3. Algorithmica

    1 publications · 17 citations

    1

    h-index

  4. IEEE Transactions on Dependable and Secure Computing

    TDSC · 1 publications · 31 citations

    1

    h-index

  5. Symposium on Discrete Algorithms

    Conference · 1 publications · 49 citations

    1

    h-index

1–5