Optimal parallel pattern matching in strings
Information and Control
The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
Algorithmics: theory & practice
Algorithmics: theory & practice
Fast parallel and serial approximate string matching
Journal of Algorithms
Introduction to algorithms
Deterministic sampling—a new technique for fast pattern matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Analysis of Boyer-Moore-type string searching algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
On improving the worst case running time of the Boyer-Moore string matching algorithm
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An Improved Algorithm for Approximate String Matching
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On the size of Boyer-Moore automata
Theoretical Computer Science
Improving Boyer-Moore-Horspool using machine-words for comparison
Proceedings of the 48th Annual Southeast Regional Conference
Performance estimation using symbolic data
Theories of Programming and Formal Methods
| Hi-index | 0.01 |