Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Algorithms for string searching
ACM SIGIR Forum
Parallel tree pattern matching
Journal of Symbolic Computation
Deterministic sampling—a new technique for fast pattern matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A lower bound for parallel string matching
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A constant-time optimal parallel string-matching algorithm
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Two-dimensional periodicity and its applications
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
AT2 bounds for a class of VLSI problems and string matching
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Symmetry breaking for suffix tree construction
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
Real-time streaming string-matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Constant-Time word-size string matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |