Efficient worst-case data structures for range searching
- 1 February 1980
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 13 (2) , 155-168
- https://doi.org/10.1007/bf00263991
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad treesActa Informatica, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975