Author:
Breslauer Dany,Colussi Livio,Toniolo Laura
Reference10 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Comm. of the ACM, 20:762–772, 1977.
3. D. Breslauer, L. Colussi, and L. Toniolo. On the Exact Complexity of the String Prefix-Matching Problem. In preparation, 1993.
4. D. Breslauer and Z. Galil. Efficient Comparison Based String Matching. J. Complexity, 1993. To appear.
5. R. Cole and R. Hariharan. Tighter Bounds on The Exact Complexity of String Matching. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 600–609, 1992.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complexity of Sequential Pattern Matching Algorithms;Randomization and Approximation Techniques in Computer Science;1998
2. Work-time optimal parallel prefix matching;Algorithms — ESA '94;1994