A data structure for dynamic range queries
- 1 December 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 15 (5) , 209-213
- https://doi.org/10.1016/0020-0190(82)90119-3
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- Quintary treesACM Transactions on Database Systems, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Decomposable searching problemsInformation Processing Letters, 1979
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973