Dynamic Tree Data Structures

Dynamic Tree Data Structures is a data organization framework that belongs to the class of dynamic data structures and is distinguished by its ability to represent hierarchical relationships with dynamically adjustable topology, enabling efficient insertions, deletions, and structural modifications during runtime.

117

Publications

7.4K

Citations

247

Authors

144

Institutions

Publications per year

2017–2026

18

Authors

247

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    7 publications · 2.2K citations

    7

    h-index

  2. RF
    Renato F. Werneck

    Microsoft (United States), United States

    4 publications · 107 citations

    4

    h-index

  3. RT
    Roberto Tamassia

    Brown University, United States

    4 publications · 184 citations

    4

    h-index

  4. ED
    Erik D. Demaine

    Massachusetts Institute of Technology, United States

    4 publications · 538 citations

    4

    h-index

  5. MC
    Martin C. Carlisle

    United States Air Force Academy, United States

    3 publications · 189 citations

    3

    h-index

1–5 of 247

Venues

  1. SIAM Journal on Computing

    8 publications · 682 citations

    8

    h-index

  2. Symposium on Discrete Algorithms

    Conference · 5 publications · 222 citations

    5

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 3 publications · 274 citations

    3

    h-index

  4. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 45 citations

    2

    h-index

  5. Reliability Engineering & System Safety

    2 publications · 91 citations

    2

    h-index

1–5