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

Authors

166

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    3 publications · 1.3K citations

    3

    h-index

  2. JG
    Joaquim Gabarró

    Universitat Politècnica de Catalunya, Spain

    2 publications · 103 citations

    2

    h-index

  3. GE
    Gregory E. Coxson

    Lockheed Martin (United States), United States

    2 publications · 92 citations

    2

    h-index

  4. BF
    Boi Faltings

    École Polytechnique Fédérale de Lausanne, Switzerland

    2 publications · 115 citations

    2

    h-index

  5. MH
    Mark H. Overmars

    Utrecht University, Netherlands

    2 publications · 84 citations

    2

    h-index

1–5 of 166

Venues

  1. Communications of the ACM

    7 publications · 244 citations

    7

    h-index

  2. Acta Informatica

    4 publications · 317 citations

    4

    h-index

  3. Information Processing Letters

    3 publications · 100 citations

    3

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 43 citations

    2

    h-index

  5. ACM SIGPLAN Notices

    2 publications · 121 citations

    2

    h-index

1–5