Back to search
Efficient worst-case data structures for range searching
Data up to Jan 2025
Published1980
Citations175
References6
Total Citations Per Year
Abstract
References (6)
The Art of Computer Programming
1968 • 16,727 citations
Multidimensional binary search trees used for associative searching
1975 • 6,899 citations
The Art of Computer Programming, Vol. 2
1981 • 887 citations
Data Structures for Range Searching
1979 • 627 citations
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
1977 • 225 citations
Efficient worst-case data structures for range searching
1980 • 175 citations
Cited By (0)
Loading...