On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first 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
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Space Time Tradeoffs for Graph Properties
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
| Hi-index | 0.00 |