Range Trees

Range Trees is a data structure that organizes multidimensional points hierarchically through nested balanced binary search trees to enable efficient orthogonal range queries.

67

Publications

2.8K

Citations

178

Authors

92

Institutions

Publications per year

2017–2026

8

Authors

178

  1. JT
    Junichi Tatemura

    NEC (United States), United States

    3 publications · 49 citations

    3

    h-index

  2. PK
    Pankaj K. Agarwal

    Duke University, United States

    2 publications · 60 citations

    3

    h-index

  3. SS
    Scott Shenker

    University of California, Berkeley, United States

    2 publications · 158 citations

    2

    h-index

  4. EW
    Emo Welzl

    Freie Universität Berlin, Germany

    2 publications · 196 citations

    2

    h-index

  5. BC
    Baoquan Chen

    Shandong University, China

    2 publications · 368 citations

    2

    h-index

1–5 of 178

Venues

  1. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 6 publications · 356 citations

    6

    h-index

  2. Acta Informatica

    3 publications · 206 citations

    3

    h-index

  3. Information Processing Letters

    3 publications · 132 citations

    3

    h-index

  4. Symposium on Discrete Algorithms

    Conference · 2 publications · 115 citations

    2

    h-index

  5. Future Generation Computer Systems

    FGCS · 2 publications · 43 citations

    2

    h-index

1–5