Lower bounds for orthogonal range searching: I. The reporting case
- 1 April 1990
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 37 (2) , 200-212
- https://doi.org/10.1145/77600.77614
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Functional Approach to Data Structures and Its Use in Multidimensional SearchingSIAM Journal on Computing, 1988
- Linear space data structures for two types of range searchDiscrete & Computational Geometry, 1987
- Fractional cascading: II. ApplicationsAlgorithmica, 1986
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Adding range restriction capability to dynamic data structuresJournal of the ACM, 1985
- Priority Search TreesSIAM Journal on Computing, 1985
- New Data Structures for Orthogonal Range QueriesSIAM Journal on Computing, 1985
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Decomposable searching problemsInformation Processing Letters, 1979
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979