Dynamic Array Data Structures

Dynamic Array Data Structures is a dynamic data structure that, unlike static arrays, permits efficient resizing during runtime by automatically reallocating memory and copying elements, thereby distinguishing it within the class of array-based data structures through its adaptive capacity to accommodate fluctuating data sizes.

13

Publications

616

Citations

31

Authors

21

Institutions

Publications per year

2017–2026

1

Authors

31

  1. LH
    Laurie Hendren

    McGill University, Canada

    2 publications · 296 citations

    2

    h-index

  2. LW
    Longhao Wang

    Chinese Academy of Sciences, China

    1 publications · 61 citations

    1

    h-index

  3. PA
    Philip A. Townsend

    University of Wisconsin–Madison, United States

    1 publications · 14 citations

    1

    h-index

  4. ML
    Martine Léonard

    Université de Rouen Normandie, France

    1 publications · 33 citations

    1

    h-index

  5. DM
    D. M. Hawken

    Swansea University, United Kingdom

    1 publications · 14 citations

    1

    h-index

1–5 of 31

Venues

  1. Computational Geometry

    1 publications · 53 citations

    1

    h-index

  2. 1

    h-index

  3. 1

    h-index

  4. International Joint Conference on Artificial Intelligence

    Conference · 1 publications · 33 citations

    1

    h-index

  5. 1

    h-index

1–5