A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Automatic text processing
A randomized algorithm for closest-point queries
SIAM Journal on Computing
Reporting points in halfspaces
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Vector quantization and signal compression
Vector quantization and signal compression
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Point location in arrangements of hyperplanes
Information and Computation
An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Fuzzy queries in multimedia database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Determinism versus non-determinism for linear time RAMs (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Dimensionality reduction techniques for proximity problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Time-Space Tradeoffs for Branching Programs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A cell probe lower bound for dynamic nearest-neighbor searching
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Cell-probe lower bounds for the partial match problem
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Cell-probe lower bounds for the partial match problem
Journal of Computer and System Sciences - Special issue: STOC 2003
Journal of Discrete Algorithms
The cell probe complexity of succinct data structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Indexability, concentration, and VC theory
Proceedings of the Third International Conference on SImilarity Search and APplications
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching
SIAM Journal on Computing
Proceedings of the Fourth International Conference on SImilarity Search and APplications
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Indexability, concentration, and VC theory
Journal of Discrete Algorithms
NNS lower bounds via metric expansion for l
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |