Author:
Régnier Mireille,Szpankowski Wojciech
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. A. Apostolico and R. Giancarlo, The Boyer-Moore-Galil String Searching Strategies Revisited, SIAM J. Compt., 15, 98–105, 1986.
2. R. Baeza-Yates and M. Régnier, Average Running Time of Boyer-Moore-Horspool Algorithm, Theoretical Computer Science, 92, 19–31, 1992.
3. P. Billingsley, Convergence of Probability Measures, John Wiley & Sons, New York, 1968.
4. A. Blumer, A. Ehrenfeucht and D. Haussler, Average Size of Suffix Trees and DAWGS, Discrete Applied Mathematics, 24, 37–45, 1989.
5. R. Boyer and J. Moore, A fast String Searching Algorithm, Comm. of the ACM, 20, 762–772, 1977.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;Average Case Analysis of Algorithms on Sequences;2011-10-14