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
Parents
117
A new approach to the maximum-flow problem
Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1988 · 1.9K citations · Full text
Learning to Compose Dynamic Tree Structures for Visual Contexts
Kaihua Tang, Hanwang Zhang, Baoyuan Wu et al. · 2019 · 542 citations
Logarithmic Lower Bounds in the Cell-Probe Model
Mihai Pǎtraşcu, Erik D. Demaine · SIAM Journal on Computing · 2006 · 213 citations
A Quadtree-Based Dynamic Attribute Indexing Method
Jean Tayeb · The Computer Journal · 1998 · 206 citations · Full text
1–5 of 117
247
7
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 247
144
Princeton University
Princeton, United States
9 h-index
17 publications
2.6K citations
Duke University
Durham, United States
6 h-index
11 publications
532 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
9 publications
2.5K citations

University of Waterloo
Waterloo, Canada
3 h-index
4 publications
274 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
6 publications
204 citations
Courant Institute of Mathematical Sciences
New York, United States
3 h-index
3 publications
184 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
4 publications
95 citations
Texas A&M University
College Station, United States
3 h-index
4 publications
131 citations
1–8 of 144
8 publications · 682 citations
8
h-index
Conference · 5 publications · 222 citations
5
h-index
TKDE · 3 publications · 274 citations
3
h-index
JEA · 2 publications · 45 citations
2
h-index
2 publications · 91 citations
2
h-index
1–5