Funder
National Research Foundation of Korea
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Analysis of Boyer–Moore-type string searching algorithms;Baeza-Yates,1990
2. Average running time of the Boyer–Moore–Horspool algorithm;Baeza-Yates;Theor. Comput. Sci.,1992
3. A fast string searching algorithm;Boyer;Commun. ACM,1977
4. Handbook of Exact String Matching Algorithms;Charras,2004
5. Tight bounds on the complexity of the Boyer–Moore string matching algorithm;Cole;SIAM J. Comput.,1994
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献