Efficient data structures for range searching on a grid
- 30 June 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (2), 254-275
- https://doi.org/10.1016/0196-6774(88)90041-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A log log n data structure for three-sided range queriesInformation Processing Letters, 1987
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Priority Search TreesSIAM Journal on Computing, 1985
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- New trie data structures which support very fast search operationsJournal of Computer and System Sciences, 1984
- Log-logarithmic worst-case range queries are possible in space Θ(N)Information Processing Letters, 1983
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977