Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
Parallel hashing—an efficient implementation of shared memory
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Parallel Dictionaries in 2-3 Trees
Proceedings of the 10th Colloquium on Automata, Languages and Programming
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 and reliable parallel hashing
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Maintaining dynamic ordered sets on processor networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Low-contention data structures
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Low-contention data structures
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |