New data structures for orthogonal range searching
Authors:
- S. AlstrupSAS. Alstrup
- G. Stolting BrodalGBG. Stolting Brodal
- T. RauheTRT. Rauhe
- 8 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 198-207
Abstract
No abstract availableThis publication has 39 references indexed in Scilit:
- Sorting in Linear Time?Journal of Computer and System Sciences, 1998
- On Data Structures and Asymmetric Communication ComplexityJournal of Computer and System Sciences, 1998
- Bounded ordered dictionaries in O(log log N) time and O(n) spaceInformation Processing Letters, 1990
- Efficient data structures for range searching on a gridJournal of Algorithms, 1988
- Computational Geometry1985
- Log-logarithmic worst-case range queries are possible in space Θ(N)Information Processing Letters, 1983
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975