Range Emptiness Queries

Range Emptiness Queries is a computational query type within range searching that determines whether a specified multidimensional range contains any data points, distinguished by its focus on the absence or presence of elements rather than their retrieval or count.

13

Publications

1.1K

Citations

33

Authors

19

Institutions

Publications per year

2017–2026

2

Authors

33

  1. SH
    Sariel Har-Peled

    University of Illinois Urbana-Champaign, United States

    2 publications · 169 citations

    2

    h-index

  2. MS
    Micha Sharir

    Tel Aviv University, Israel

    2 publications · 30 citations

    2

    h-index

  3. PB
    Philip Bille

    Technical University of Denmark, Denmark

    2 publications · 25 citations

    2

    h-index

  4. BA
    Boris Aronov

    New York University, United States

    2 publications · 169 citations

    2

    h-index

  5. HS
    Hayim Shaul

    IBM Research - Haifa, Israel

    2 publications · 30 citations

    2

    h-index

1–5 of 33

Venues

  1. SIAM Journal on Computing

    3 publications · 164 citations

    3

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 13 citations

    1

    h-index

  3. Information Systems Frontiers

    1 publications · 22 citations

    1

    h-index

  4. Theoretical Computer Science

    1 publications · 19 citations

    1

    h-index

  5. IEEE Access

    1 publications · 11 citations

    1

    h-index

1–5