On the comparison complexity of the string prefix-matching problem

Research on a faster algorithm for pattern matching

IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages

On the Complexity of Determining the Period of a String

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Fast prefix matching of bounded strings

Journal of Experimental Algorithmics (JEA)

Validating the knuth-morris-pratt failure function, fast and online

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications

Validating the Knuth-Morris-Pratt Failure Function, Fast and Online

Theory of Computing Systems