Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Optimal bounds for decision problems on the CRCW PRAM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Optimal and sublogarithmic time randomized parallel sorting algorithms
SIAM Journal on Computing
Faster optimal parallel prefix sums and list ranking
Information and Computation
Optimal on-line load balancing
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Matching partition a linked list and its optimization
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
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
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
Parallel algorithms for generating random permutations on a shared memory machine
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Not all keys can be hashed in constant time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Constant-time parallel integer sorting
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 parallel generation of random permutations
Proceedings of the 18th international colloquium on Automata, languages and programming
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallel Retrieval of Scattered Information
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Randomized speed-ups in parallel computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Constant-time parallel integer sorting
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
In-place techniques for parallel convex hull algorithms (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Improved parallel integer sorting without concurrent writing
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
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
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)
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Provably efficient scheduling for languages with fine-grained parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Parallelism in sequential functional languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Proceedings of the twelfth annual symposium on Computational geometry
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Fast deterministic processor allocation
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
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Delayed path coupling and generating random permutations via distributed stochastic processes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
Scheduling against an adversarial network
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
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
The Complexity of Distributions
SIAM Journal on Computing
| Hi-index | 0.00 |