Data Structures for Range Searching

The Art of Computer Programming

1968 • 16,727 citations

Multidimensional binary search trees used for associative searching

1975 • 6,899 citations

An Algorithm for Finding Best Matches in Logarithmic Expected Time

1977 • 2,694 citations

Quad trees a data structure for retrieval on composite keys

1974 • 1,968 citations

A Nonparametric Estimate of a Multivariate Density Function

1965 • 768 citations

Multidimensional divide-and-conquer

1980 • 674 citations

Multidimensional Binary Search Trees in Database Applications

1979 • 410 citations

An Algorithm for Finding Nearest Neighbors

1975 • 383 citations

Decomposable searching problems

1979 • 343 citations

Molecular Model-Building by Computer

1966 • 331 citations

Partial-Match Retrieval Algorithms

1976 • 253 citations

Multidimensional Searching Problems

1976 • 251 citations

Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

1977 • 225 citations

A data structure for orthogonal range queries

1978 • 206 citations

Efficient worst-case data structures for range searching

1980 • 175 citations

The complexity of finding fixed-radius near neighbors

1977 • 114 citations

Sorting and Searching in Multisets

1976 • 83 citations

Quintary trees

1980 • 79 citations

Analysis of range searches in quad trees

1975 • 74 citations

Multi-dimensional clustering for data base organizations

1977 • 66 citations

Application of Principal Component Analysis to Multikey Searching

1976 • 55 citations

Predicate-oriented database search algorithms

1978 • 53 citations

Data types and structures

1978 • 35 citations

Some decidability results about regular and pushdown translations

1979 • 28 citations

Finding near neighbours in K-dimensional space

1975 • 26 citations

Heuristics for partial-match retrieval data base design

1976 • 19 citations

Reduced combined indexes for efficient multiple attribute retrieval

1977 • 17 citations

General methods for parallel-searching.

1973 • 8 citations

Balanced Forests of K-D* Trees as a Dynamic Data Structure.

1978 • 8 citations

A class of hybrid list file organizations

1978 • 7 citations

A near optimal data structure for a type of range query problem

1979 • 6 citations

Avoiding redundant record accesses in unsorted multilist file organizations

1977 • 5 citations

Theil's estimator

1977 • 4 citations