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
Optimal bounds for the predecessor problem
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
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A linear lower bound on index size for text retrieval
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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
A linear lower bound on index size for text retrieval
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The cell probe complexity of succinct data structures
Theoretical Computer Science
The cell probe complexity of succinct data structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Succinct representations of permutations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Succinct representations of permutations and functions
Theoretical Computer Science
Hi-index | 0.00 |