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
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
New bounds in cell probe model
New bounds in cell probe model
Approximate closest-point queries in high dimensions
Information Processing Letters
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 the cell probe complexity of polynomial evaluation
Theoretical Computer Science
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
Approximate nearest neighbor queries revisited
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Communication complexity
Fuzzy queries in multimedia database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Randomized complexity lower bounds
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Neighborhood preserving hashing and approximate queries
SODA '94 Proceedings of the fifth 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)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
The Bit Probe Complexity Measure Revisited
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
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
On Approximate Nearest Neighbors in Non-Euclidean Spaces
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth 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
Tighter bounds for nearest neighbor search and related problems in the cell probe model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Supporting subseries nearest neighbor search via approximation
Proceedings of the ninth international conference on Information and knowledge management
A cell probe lower bound for dynamic nearest-neighbor searching
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
IEEE Transactions on Knowledge and Data Engineering
High-dimensional nearest neighbor search with remote data centers
Knowledge and Information Systems
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Space Time Tradeoffs for Graph Properties
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
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
Entropy based nearest neighbor search in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
IEEE Transactions on Knowledge and Data Engineering
Neighborhood Property--Based Pattern Selection for Support Vector Machines
Neural Computation
Vector representations for efficient comparison and search for similar strings
Cybernetics and Systems Analysis
Journal of Discrete Algorithms
Digital Watermarking and Steganography
Digital Watermarking and Steganography
Combinatorial Framework for Similarity Search
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Communications of the ACM
The cell probe complexity of succinct data structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An improved algorithm finding nearest neighbor using Kd-trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Indexability, concentration, and VC theory
Proceedings of the Third International Conference on SImilarity Search and APplications
ACM Transactions on Computation Theory (TOCT)
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
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
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.02 |