Time-space-optimal string matching

This publication has 7 references indexed in Scilit:

• Linear-time string-matching using only a fixed number of local storage locations
  Theoretical Computer Science, 1981
• Saving Space in Fast String-Matching
  SIAM Journal on Computing, 1980
• On improving the worst case running time of the Boyer-Moore string matching algorithm
  Communications of the ACM, 1979
• Real-time recognition of substring repetition and reversal
  Theory of Computing Systems, 1977
• A fast string searching algorithm
  Communications of the ACM, 1977
• Fast Pattern Matching in Strings
  SIAM Journal on Computing, 1977
• The equation $a^M=b^Nc^P$ in a free group.
  The Michigan Mathematical Journal, 1962