Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Limits on the power of concurrent-write parallel machines
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal bounds for decision problems on the CRCW PRAM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Towards optimal parallel bucket sorting
Information and Computation
Relations between concurrent-write models of parallel computation
SIAM Journal on Computing
Data structures and algorithms for approximate string matching
Journal of Complexity
The complexity of parallel search
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
An optimal parallel dictionary
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimal separations between concurrent-write parallel machines
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
On parallel hashing and integer sorting
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Deterministic sampling—a new technique for fast pattern matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Not all keys can be hashed in constant time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
New Simulations between CRCW PRAMs
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
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
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Real-time parallel hashing on the GPU
ACM SIGGRAPH Asia 2009 papers
| Hi-index | 0.00 |