Dynamic Data Structures

Dynamic Data Structures is a type of data structure that uses dynamic memory allocation to allow its size and organization to change during program execution in response to insertions, deletions, and other updates, in contrast to static data structures with fixed, compile-time–determined size.

426

Publications

26.6K

Citations

827

Authors

334

Institutions

Publications per year

2017–2026

56

Authors

827

  1. GN
    Gonzalo Navarro

    University of Chile, Chile

    14 publications · 623 citations

    12

    h-index

  2. LA
    Lars Arge

    Aarhus University, Denmark

    9 publications · 512 citations

    9

    h-index

  3. RE
    Robert E. Tarjan

    Princeton University, United States

    9 publications · 545 citations

    9

    h-index

  4. HK
    Haim Kaplan

    Tel Aviv University, Israel

    8 publications · 429 citations

    8

    h-index

  5. JS
    Jeffrey Scott Vitter

    Duke University, United States

    7 publications · 549 citations

    7

    h-index

1–5 of 827

Venues

  1. SIAM Journal on Computing

    19 publications · 1.5K citations

    15

    h-index

  2. Symposium on Discrete Algorithms

    Conference · 10 publications · 486 citations

    10

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 8 publications · 369 citations

    8

    h-index

  4. ACM Transactions on Database Systems

    TODS · 8 publications · 2.1K citations

    8

    h-index

  5. IEEE Transactions on Software Engineering

    TSE · 6 publications · 1.2K citations

    6

    h-index

1–5