Balanced Search Trees
Balanced Search Trees is a type of binary search tree data structure that maintains approximate height balance through structural constraints or dynamic reorganization to ensure logarithmic time complexity for basic operations.
80
Publications
6.3K
Citations
166
Authors
102
Institutions
Publications per year
2017–2026
6
Parents
80
Self-adjusting binary search trees
Daniel D. Sleator, Robert E. Tarjan · Journal of the ACM · 1985 · 1.2K citations · Full text
Extendible hashing—a fast access method for dynamic files
Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger et al. · ACM Transactions on Database Systems · 1979 · 669 citations · Full text
Dahlia Malkhi, Moni Naor, David Ratajczak · 2002 · 639 citations
Binary Search Trees of Bounded Balance
J. Nievergelt, Edward M. Reingold · SIAM Journal on Computing · 1973 · 263 citations
1–5 of 80
166
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 166
102
University of California, Berkeley
Berkeley, United States
4 h-index
4 publications
697 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
5 publications
134 citations
Tsinghua University
Beijing, China
3 h-index
5 publications
345 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
7 publications
759 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
2 publications
891 citations
University of Vienna
Vienna, Austria
2 h-index
4 publications
54 citations

Weizmann Institute of Science
Rehovot, Israel
2 h-index
2 publications
662 citations

California Maritime Academy
Vallejo, United States
2 h-index
2 publications
92 citations
1–8 of 102
7 publications · 244 citations
7
h-index
4 publications · 317 citations
4
h-index
3 publications · 100 citations
3
h-index
TPDS · 2 publications · 43 citations
2
h-index
2 publications · 121 citations
2
h-index
1–5