Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Tighter Upper Bounds on the Exact Complexity of String MatchingRichard Cole, Ramesh Hariharan. SICOMP, 26(3):803-856, 1997. Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract)Richard Cole, Ramesh Hariharan. focs 1992: 600-609 Tight Bounds on the Complexity of the Boyer-Moore String Matching AlgorithmRichard Cole. soda 1991: 224-233 Tight Bounds on the Complexity of the Boyer-Moore String Matching AlgorithmRichard Cole. SICOMP, 23(5):1075-1091, 1994.
The following publications are possibly variants of this publication: