Hariharan, Ramesh Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Cole, R., Hariharan, R., Paterson, M., & Zwick, U. (1995). Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM Journal on Computing, 24(1), 30-45. doi:10.1137/S0097539793245829.