Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
Faster optimal parallel prefix sums and list ranking
Information and Computation
The parallel simplicity of compaction and chaining
Proceedings of the seventeenth international colloquium on Automata, languages and programming
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
Information and Computation
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 and reliable parallel hashing
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Improved deterministic parallel integer sorting
Information and Computation
Towards a theory of nearly constant time parallel algorithms
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On a compaction theorem of Ragde
Information Processing Letters
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Fast and Optimal Simulations between CRCW PRAMs
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Distribution-sensitive algorithms
Nordic Journal of Computing
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
| Hi-index | 0.00 |