Efficient worst-case data structures for range searching
Jon Louis Bentley, Hermann A. Maurer · Acta Informatica · 1980
Cited by 179 works. doi:10.1007/bf00263991
Authors
References
- The Art of Computer Programming
- Multidimensional binary search trees used for associative searching
- Data Structures for Range Searching
- The Art of Computer Programming, Vol. 2
- Efficient worst-case data structures for range searching
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees