Optimal parallel pattern matching in strings
Information and Control
Optimal parallel algorithms for string matching
Information and Control
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Optimal parallel suffix-prefix matching algorithm and applications
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An optimal O(log n)time parallel string matching algorithm
SIAM Journal on Computing
Deterministic sampling: a new technique for fast pattern matching
SIAM Journal on Computing
A lower bound for parallel string matching
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth 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
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel two dimensional pattern matching
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Work-time-optimal parallel algorithms for string problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast pattern matching for entropy bounded text
DCC '95 Proceedings of the Conference on Data Compression
| Hi-index | 0.00 |
Given a pattern string, we describe a way to preprocess it. We design a constant-time optimal parallel algorithm for finding all occurences of the (preprocessed) pattern in any given text.