Randomized Search Trees

Randomized Search Trees is a type of binary search tree data structure in which the insertion and deletion operations use randomization to maintain balanced tree height with high probability, thereby ensuring efficient average-case performance for search, insertion, and deletion operations.

33

Publications

4.5K

Citations

109

Authors

55

Institutions

Publications per year

2017–2026

10

Variants

Randomized Binary Search Trees

Authors

109

  1. JW
    J. Wambsganß

    Heidelberg University, Germany

    3 publications · 107 citations

    3

    h-index

  2. MJ
    M. J. Graham

    California Institute of Technology, United States

    3 publications · 107 citations

    3

    h-index

  3. LW
    Louis Wehenkel

    University of Liège, Belgium

    3 publications · 113 citations

    3

    h-index

  4. RM
    Raphaël Marée

    University of Liège, Belgium

    3 publications · 113 citations

    3

    h-index

  5. SG
    S. G. Djorgovski

    California Institute of Technology, United States

    3 publications · 107 citations

    3

    h-index

1–5 of 109

Venues

  1. Astronomy and Astrophysics

    3 publications · 107 citations

    3

    h-index

  2. Symposium on Discrete Algorithms

    Conference · 1 publications · 34 citations

    1

    h-index

  3. 1

    h-index

  4. Information Sciences

    1 publications · 30 citations

    1

    h-index

  5. Robotica

    1 publications · 19 citations

    1

    h-index

1–5