On the number of range queries in k-space

DOI10.1016/0166-218X(79)90045-3zbMath0413.68070OpenAlexW2078424624MaRDI QIDQ598818

James B. Saxe

Publication date: 1979

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(79)90045-3

zbMATH Keywords

searchingrange querypoints lying within a hyper-rectanglerandom distributions of points

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (1)

On the minimum total length of interval systems expressing all intervals, and range-restricted queries

Cites Work

• Efficient worst-case data structures for range searching
• Unnamed Item

This page was built for publication: On the number of range queries in k-space