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
Variants
Recursive Data StructuresString Data StructuresSuccinct Data Structures
Parents
426
J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik · ACM Transactions on Database Systems · 1984 · 1.1K citations · Full text
Software transactional memory for dynamic-sized data structures
Maurice Herlihy, Victor Luchangco, Mark Moir et al. · 2003 · 999 citations
John T. Robinson · 1981 · 888 citations · Full text
1–5 of 426
827
12
h-index
9
h-index
9
h-index
8
h-index
7
h-index
1–5 of 827
334

University of Waterloo
Waterloo, Canada
13 h-index
23 publications
1.1K citations
Brown University
Providence, United States
12 h-index
15 publications
2.7K citations
University of Chile
Santiago, Chile
12 h-index
15 publications
661 citations
Purdue University West Lafayette
West Lafayette, United States
11 h-index
16 publications
795 citations

Aarhus University
Aarhus, Denmark
10 h-index
18 publications
799 citations
Princeton University
Princeton, United States
10 h-index
18 publications
1.7K citations
Duke University
Durham, United States
9 h-index
21 publications
1.3K citations

Tel Aviv University
Tel Aviv, Israel
9 h-index
15 publications
765 citations
1–8 of 334
19 publications · 1.5K citations
15
h-index
Conference · 10 publications · 486 citations
10
h-index
TKDE · 8 publications · 369 citations
8
h-index
TODS · 8 publications · 2.1K citations
8
h-index
TSE · 6 publications · 1.2K citations
6
h-index
1–5