Efficient data structures for range searching on a grid

Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time

Michael L. Fredman, János Komlós, Endre Szemerédi · Journal of the ACM · 1984 · 758 citations · Full text

Computing, Computer Science, Data Management +4

Scaling and related techniques for geometry problems

Harold N. Gabow, Jon Bentley, Robert E. Tarjan · 1984 · 526 citations

Computing, Computer Science, Computational Geometry +15

Priority Search Trees

Edward M. McCreight · SIAM Journal on Computing · 1985 · 499 citations

Computing, Computer Science, Algorithms +12

Preserving order in a forest in less than logarithmic time and linear space

P. van Emde Boas · Information Processing Letters · 1977 · 424 citations

Natural Resources, Forestry, Forest Ecology +1

Log-logarithmic worst-case range queries are possible in space Θ(N)

Dan E. Willard · Information Processing Letters · 1983 · 321 citations

Computing, Computer Science, Mathematics +11