Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
New data structures for orthogonal range queries
SIAM Journal on Computing
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Filtering search: a new approach to query answering
SIAM Journal on Computing
Lower bounds for dynamic range query problems that permit subtraction
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Space-time tradeoffs for orthogonal range queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Orthogonal Range Queries in OLAP
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Efficient and secure distribution of massive geo-spatial data
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Incrementally maintaining run-length encoded attributes in column stores
Proceedings of the 16th International Database Engineering & Applications Sysmposium
approximate range searching: the absolute model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Two dimensional range minimum queries and fibonacci lattices
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |