Tighter Lower Bounds on the Exact Complexity of String Matching

Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick. Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM Journal on Computing, 24(1):30-45, 1995.

@article{ColeHPZ95,
  title = {Tighter Lower Bounds on the Exact Complexity of String Matching},
  author = {Richard Cole and Ramesh Hariharan and Mike Paterson and Uri Zwick},
  year = {1995},
  researchr = {https://researchr.org/publication/ColeHPZ95},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {24},
  number = {1},
  pages = {30-45},
}