How to distribute a dictionary in a complete network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Applications of the fusion tree method to computational geometry and searching
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth 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
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Dynamic generation of discrete random variates
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Simple randomized algorithms for closest pair problems
Nordic Journal of Computing
An efficient randomized algorithm for the closest pair problem on colored point sets
Nordic Journal of Computing
A New Trade-Off for Deterministic Dictionaries
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |