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
Work-time-optimal parallel algorithms for string problems
STOC '95 Proceedings of the twenty-seventh 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
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
Processor Array Architectures for Deep Packet Classification
IEEE Transactions on Parallel and Distributed Systems
A programmable array processor architecture for flexible approximate string matching algorithms
Journal of Parallel and Distributed Computing
Processor array architectures for flexible approximate string matching
Journal of Systems Architecture: the EUROMICRO Journal
Constant-Time word-size string matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
Given a pattern string, we describe a way to preprocess it. We design a CRCW-PRAM constant time optimal parallel algorithm for finding all occurrences of the (preprocessed) pattern in any given text.