Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Optimal parallel pattern matching in strings
Information and Control
Efficient two-dimensional pattern matching in the presence of errors
Information Sciences: an International Journal
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Matching patterns in strings subject to multi-linear transformations
Theoretical Computer Science
Fast parallel and serial approximate string matching
Journal of Algorithms
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fast parallel and serial multidimensional approximate array matching
Theoretical Computer Science
A Space-Economical Suffix Tree Construction Algorithm
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
An Improved Algorithm for Approximate String Matching
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Efficient 2-dimensional approximate matching of non-rectangular figures
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Tight bounds on the complexity of the Boyer-Moore string matching algorithm
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Alphabet independent two dimensional matching
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
Faster two-dimensional pattern matching with rotations
Theoretical Computer Science
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Hi-index | 0.00 |