Searching for "Tighter Lower Bounds on the Exact Complexity of String Matching." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Tighter Lower Bounds on the Exact Complexity of String Matching
by Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick — 2002
…Tighter Lower Bounds on The Exact Complexity of String Matching Richard Cole Ramesh Hariharan…
Cited by 16 (4 self) – Add To MetaCart

Plan
by Thierry Lecroq
…. Paterson, and U. Zwick. Tighter lower bounds on the exact complexity of string matching. SIAM J. Comput…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB