Optimal parallel pattern matching in strings
Information and Control
Parallel construction of a suffix tree
14th International Colloquium on Automata, languages and programming
A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimal parallel algorithms for forest and term matching
Theoretical Computer Science
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Optimal parallel algorithms for string matching
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Algorithms for string searching
ACM SIGIR Forum
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second 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
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
Parallel construction and query of suffix trees for two-dimensional matrices
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel 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)
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Average-Case Communication-Optimal Parallel Parenthesis Matching
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Massively Parallel Suffix Array Construction
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
| Hi-index | 0.00 |