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
Probabilistic analysis of algorithms
Probabilistic analysis of algorithms
Parallel algorithms for computing linked list prefix
Journal of Parallel and Distributed Computing
An optimal parallel dictionary
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Not all keys can be hashed in constant time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Compact deterministic distributed dictionaries (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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)
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Allocating weighted jobs in parallel
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
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.02 |