Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Multidimensional divide-and-conquer
Communications of the ACM
Succinct Dynamic Data Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Optimal External Memory Interval Management
SIAM Journal on Computing
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Orthogonal range searching in linear and almost-linear space
Computational Geometry: Theory and Applications
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Rank/select on dynamic compressed sequences and applications
Theoretical Computer Science
Compressing and indexing labeled trees, with applications
Journal of the ACM (JACM)
Succinct representations of dynamic strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Space-Efficient and fast algorithms for multidimensional dominance reporting and counting
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Dynamic range selection in linear space
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Space efficient data structures for dynamic orthogonal range counting
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We present a linear-space data structure that maintains a dynamic set of n points with coordinates of real numbers on the plane to support orthogonal range counting, as well as insertions and deletions, in O((lg n/lg lg n)2) time. This provides faster support for updates than previous results with the same bounds on space cost and query time. We also obtain two other new results by considering the same problem for points on a U × U grid, and by designing the first succinct data structures for a dynamic integer sequence to support range counting.