The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM (JACM)
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Space-time tradeoffs for orthogonal range queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
Quasi-Valid range querying and its implications for nearest neighbor problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
How hard is halfspace range searching?
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Dominance range-query: the one-reporting case
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Can visibility graphs be represented compactly?
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for off-line range searching
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Quasilinear algorithms for processing relational calculus expressions (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for set intersection queries
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM (JACM)
A Stochastic Programming Approach for Range Query Retrieval Problems
IEEE Transactions on Knowledge and Data Engineering
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
Managing and analyzing massive data sets with data cubes
Handbook of massive data sets
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
Dynamic multidimensional data cubes
Multidimensional databases
Tight bounds for the partial-sums problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
IEEE Transactions on Computers
Polytope range searching and integral geometry
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Criteria for reducibility of moving objects closeness problem
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Incrementally maintaining run-length encoded attributes in column stores
Proceedings of the 16th International Database Engineering & Applications Sysmposium
| Hi-index | 0.01 |