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
Reduced memory space for multi-dimensional search trees
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
BLASTING through the information theoretic barrier with FUSION TREES
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Multidimensional divide-and-conquer
Communications of the ACM
Handbook of Algorithms
Optimal Algorithms for List Indexing and Subset Rank
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
A provably efficient computational model for approximate spatiotemporal retrieval
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
An efficient randomized algorithm for the closest pair problem on colored point sets
Nordic Journal of Computing
Hi-index | 0.00 |