Concepedia

Balanced Binary Search Trees

Balanced Binary Search Trees is a dynamic data structure that organizes elements in a binary tree format such that the height difference between the left and right subtrees of any node is constrained to ensure logarithmic height, thereby guaranteeing efficient search, insertion, and deletion operations.

60

Publications

3.6K

Citations

132

Authors

84

Institutions

Publications per year

2017–2026

7

Parents

Publications

60

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

, , +15

The adaptive radix tree: ARTful indexing for main-memory databases

Viktor Leis, Alfons Kemper, Thomas Neumann · 2013 · 416 citations

, , +15

Binary Search Trees of Bounded Balance

J. Nievergelt, Edward M. Reingold · SIAM Journal on Computing · 1973 · 263 citations

, , +7

Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

D. T. Lee, C. K. Wong · Acta Informatica · 1977 · 222 citations

, , +10

Deep Reinforcement Learning for Multiparameter Optimization in <i>de novo</i> Drug Design

Niclas Ståhl, Göran Falkman, Alexander Karlsson et al. · Journal of Chemical Information and Modeling · 2019 · 217 citations

, , +14

1–5 of 60

Authors

132

  1. EM
    Edward M. Reingold

    University of Illinois Urbana-Champaign, United States

    2 publications · 313 citations

    2

    h-index

  2. JB
    Jonas Boström

    AstraZeneca (Sweden), Sweden

    2 publications · 262 citations

    2

    h-index

  3. RE
    Robert E. Tarjan

    Princeton University, United States

    2 publications · 91 citations

    2

    h-index

  4. GE
    Gregory E. Coxson

    Lockheed Martin (United States), United States

    2 publications · 92 citations

    2

    h-index

  5. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    2 publications · 68 citations

    2

    h-index

1–5 of 132

Institutions

84

  1. Carnegie Mellon University

    Pittsburgh, United States

    6 h-index

    12 publications

    425 citations

  2. Princeton University

    Princeton, United States

    2 h-index

    2 publications

    40 citations

  3. IBM (United States)

    Armonk, United States

    2 h-index

    3 publications

    1.4K citations

  4. University of Skövde

    Skövde, Sweden

    2 h-index

    8 publications

    1K citations

  5. AstraZeneca (Sweden)

    Södertälje, Sweden

    2 h-index

    2 publications

    262 citations

  6. University of Waterloo

    Waterloo, Canada

    2 h-index

    2 publications

    41 citations

  7. Sensors (United States)

    Los Gatos, United States

    2 h-index

    2 publications

    92 citations

  8. IBM Research - Thomas J. Watson Research Center

    Yorktown Heights, United States

    2 h-index

    2 publications

    891 citations

1–8 of 84

Venues

  1. Communications of the ACM

    9 publications · 292 citations

    9

    h-index

  2. Information Processing Letters

    3 publications · 106 citations

    3

    h-index

  3. The Computer Journal

    2 publications · 49 citations

    2

    h-index

  4. Acta Informatica

    2 publications · 287 citations

    2

    h-index

  5. Journal of Functional Programming

    2 publications · 88 citations

    2

    h-index

1–5