Speeding up two string-matching algorithms

This publication has 14 references indexed in Scilit:

• Average running time of the Boyer-Moore-Horspool algorithm
  Theoretical Computer Science, 1992
• Fast string searching
  Software: Practice and Experience, 1991
• The Boyer–Moore–Galil String Searching Strategies Revisited
  SIAM Journal on Computing, 1986
• Transducers and repetitions
  Theoretical Computer Science, 1986
• The Myriad Virtues of Subword Trees
  Published by Springer Nature ,1985
• The smallest automation recognizing the subwords of a text
  Theoretical Computer Science, 1985
• A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
  SIAM Journal on Computing, 1980
• Practical fast searching in strings
  Software: Practice and Experience, 1980
• On improving the worst case running time of the Boyer-Moore string matching algorithm
  Communications of the ACM, 1979
• A fast string searching algorithm
  Communications of the ACM, 1977