Optimal parallel pattern matching in strings
Information and Control
Optimal parallel algorithms for string matching
Information and Control
String-matching cannot be done by a two-head one-way deterministic finite automation
Information Processing Letters
An optimal O(log n)time parallel string matching algorithm
SIAM Journal on Computing
Deterministic sampling—a new technique for fast pattern matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A fast string searching algorithm
Communications of the ACM
A time-space tradeoff for sorting on a general sequential model of computation
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Relations between concurrent-write models of parallel computation
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Lower Bounds on String-Matching
Lower Bounds on String-Matching
A constant-time optimal parallel string-matching algorithm
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
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A constant-time optimal parallel string-matching algorithm
Journal of the ACM (JACM)
On the Complexity of Determining the Period of a String
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
| Hi-index | 0.00 |