The Complexity of Pattern Matching for a Random String
- 1 August 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (3) , 368-387
- https://doi.org/10.1137/0208029
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On the Worst-Case Behavior of String-Searching AlgorithmsSIAM Journal on Computing, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- Efficient string matchingCommunications of the ACM, 1975