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
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Dynamic programming: NFA simulation
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Hi-index | 0.00 |