Dynamic Order Statistics is a dynamic data structure that extends balanced binary search trees to efficiently support order-statistic operations, such as selecting the i-th smallest element and determining the rank of a given element, while allowing for dynamic insertions and deletions.
5
Publications
152
Citations
26
Authors
13
Institutions
Publications per year
2017–2026
1
Parents
Publications
5
Matteo Mitrano, Sangjun Lee, Ali Husain et al. · Science Advances · 2019 · 84 citations · Full text
Order preserving linear hashing using dynamic key statistics
John T. Robinson · 1985 · 16 citations · Full text
1–5 of 5
Authors
26
- JS
1
h-index
- PA
1
h-index
- AMAlejandra M. González-Mejía
Environmental Protection Agency, United States
1 publications · 18 citations
1
h-index
- SA
1
h-index
- JTJohn T. Robinson
IBM Research - Thomas J. Watson Research Center, United States
1 publications · 16 citations
1
h-index
1–5 of 26
Institutions
13
Atilim University
Ankara, Türkiye
1 h-index
1 publications
11 citations
American University of Beirut
Beirut, Lebanon
1 h-index
1 publications
18 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
1 publications
16 citations
Environmental Protection Agency
Washington, United States
1 h-index
2 publications
36 citations
National Institute of Standards and Technology
Gaithersburg, United States
1 h-index
1 publications
84 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
7 publications
588 citations
Oak Ridge Associated Universities
Oak Ridge, United States
1 h-index
1 publications
18 citations
Stanford University
Stanford, United States
1 h-index
2 publications
168 citations
1–8 of 13
Venues
- Science Advances
1 publications · 84 citations
1
h-index
- The Journal of Physical Chemistry B
1 publications · 23 citations
1
h-index
- Environmental Science & Technology
1 publications · 18 citations
1
h-index
- Communication in Statistics- Theory and Methods
1 publications · 11 citations
1
h-index
1–4