Open Problems in Stringology

This publication has 14 references indexed in Scilit:

• Pattern Matching Machine implementation of a fast test for unique decipherability
  Information Processing Letters, 1984
• Optimal parallel algorithms for string matching
  Published by Association for Computing Machinery (ACM) ,1984
• Time-space-optimal string matching
  Journal of Computer and System Sciences, 1983
• String Matching in Real Time
  Journal of the ACM, 1981
• On improving the worst case running time of the Boyer-Moore string matching algorithm
  Communications of the ACM, 1979
• A Linear-Time On-Line Recognition Algorithm for ``Palstar''
  Journal of the ACM, 1978
• A fast string searching algorithm
  Communications of the ACM, 1977
• Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
  Information Processing Letters, 1976
• Efficient string matching
  Communications of the ACM, 1975
• On the computational complexity of algorithms
  Transactions of the American Mathematical Society, 1965