Reference21 articles.
1. A. Aho. Algorithms for finding patterns in strings. Handbook of theoretical computer science, Vol 1, Van Leeuwen Ed., 1989.
2. D. Breslauer and Z. Galil. An optimal O(log log n) time parallel string matching algorithm. SIAM J. Computing, 19:6, 1051–1058.
3. D. Breslauer and Z. Galil. A lower bound for parallel string matching. Proc 23rd Annual ACM Symposium on Theory of Computation, 1991, 439–443.
4. M. Blum and S. Kannan. Designing Programs That Check Their Work. Proc 21st Annual Annual ACM Symposium on Theory of Computation, 1989, 86–97.
5. R. Boyer and S. Moore. A fast string matching algorithm. Communications of ACM, 20(1977), 762–772.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献