Order Statistics Trees

Order Statistics Tree is a augmented self-balancing binary search tree that, in addition to supporting standard operations, enables efficient determination of the rank of a node or retrieval of a node by its rank, thereby extending the basic binary search tree with order statistic capabilities.

5

Publications

143

Citations

11

Authors

7

Institutions

Publications per year

2017–2026

0

Variants

Order Statistic Tree

Authors

11

  1. NN
    Nassir Navab

    Technical University of Munich, Germany

    1 publications · 32 citations

    1

    h-index

  2. DK
    Dhiraj K. Pradhan

    University of Bristol, United Kingdom

    1 publications · 56 citations

    1

    h-index

  3. VB
    V. B. Nevzorov

    St Petersburg University, Russia

    1 publications · 30 citations

    1

    h-index

  4. AK
    Amin Katouzian

    Technical University of Munich, Germany

    1 publications · 32 citations

    1

    h-index

  5. NB
    N. Balakrishnan

    McMaster University, Canada

    1 publications · 11 citations

    1

    h-index

1–5 of 11

Venues

  1. Journal of Statistical Planning and Inference

    2 publications · 41 citations

    2

    h-index

  2. IEEE Transactions on Signal Processing

    1 publications · 56 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 32 citations

    1

    h-index

1–3