Optimal parallel pattern matching in strings
Information and Control
Optimal parallel algorithms for string matching
Information and Control
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Relations between concurrent-write models of parallel computation
SIAM Journal on Computing
Faster optimal parallel prefix sums and list ranking
Information and Computation
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On parallel integer merging
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
A lower bound for parallel string matching
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Tight bounds on the complexity of the Boyer-Moore string matching algorithm
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |