Author:
Breslauer Dany,Colussi Livio,Toniolo Laura
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. of the ACM, 20:762–772, 1977.
2. D. Breslauer. Fast Parallel String Prefix-Matching. Technical Report CUCS-041-92, Computer Science Dept., Columbia University, 1992.
3. D. Breslauer, L. Colussi, and L. Toniolo. Tight Comparison Bounds for the String Prefix-Matching Problem. Inform. Process. Lett., 47(1):51–57, 1993.
4. D. Breslauer and Z. Galil. Efficient Comparison Based String Matching. J. Complexity, 9(3):339–365, 1993.
5. R. Cole, M. Crochemore, Z. Galil, L. Gasieniec, R. Hariharan, S. Muthukrishnan, K. Park, and W. Rytter. Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 248–258, 1993.