Data Structures for Retrieval on Square Grids
- 1 November 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (4) , 919-931
- https://doi.org/10.1137/0215064
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Non-partitionable point setsInformation Processing Letters, 1984
- A data structure for dynamic range queriesInformation Processing Letters, 1982
- Polygon RetrievalSIAM Journal on Computing, 1982
- The Complexity of Maintaining an Array and Computing Its Partial SumsJournal of the ACM, 1982
- Inherent complexity trade-offs for range query problemsTheoretical Computer Science, 1981
- Two general methods for dynamizing decomposable searching problemsComputing, 1981
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- Decomposable searching problemsInformation Processing Letters, 1979
- A data structure for orthogonal range queriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978