scientific article; zbMATH DE number 1256698

MaRDI QIDQ4228434zbMATH OpenFDO

Authors Ramesh Hariharan, Richard Cole

Publication date 21 January 2002

zbMATH Keywords

string matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• Tighter Lower Bounds on the Exact Complexity of String Matching
• Tighter Upper Bounds on the Exact Complexity of String Matching
• On the Exact Complexity of String Matching: Lower Bounds
• On the Exact Complexity of String Matching: Upper Bounds
• Exact bounds on the complexity of sequential string matching algorithms
• Tight comparison bounds for the string prefix-matching problem
• scientific article; zbMATH DE number 1615293
• Tight chip area lower bounds for string matching
• On the complexity of string matching for graphs
• On the Complexity of String Matching for Graphs

Cited in

(8)

• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• The exact online string matching problem: a review of the most recent results
• Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
• scientific article; zbMATH DE number 7651042 (Why is no real title available?)
• How the character comparison order shapes the shift function of on-line pattern matching algorithms
• On Simon's string searching algorithm
• Tight comparison bounds for the string prefix-matching problem
• A simple fast hybrid pattern-matching algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228434)