Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
An optimal parallel dictionary
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A guided tour of Chernoff bounds
Information Processing Letters
On parallel hashing and integer sorting
Proceedings of the seventeenth international colloquium on Automata, languages and programming
The parallel simplicity of compaction and chaining
Proceedings of the seventeenth international colloquium on Automata, languages and programming
On parallel hashing and integer sorting
On parallel hashing and integer sorting
Not all keys can be hashed in constant time
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
The power of Collision: randomized parallel algorithms for chaining and integer sorting
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
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
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Parallel Shortest Path for Arbitrary Graphs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Δ-stepping: a parallelizable shortest path algorithm
Journal of Algorithms
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
Real-time parallel hashing on the GPU
ACM SIGGRAPH Asia 2009 papers
Tight bounds for parallel randomized load balancing: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |