Pages that link to "Item:Q1326953"
From MaRDI portal
The following pages link to Exact bounds on the complexity of sequential string matching algorithms (Q1326953):
Displaying 13 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- On Simon's string searching algorithm (Q685473) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776) (← links)
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications (Q2802951) (← links)
- The exact online string matching problem: a review of the most recent results (Q2875102) (← links)
- On the Exact Complexity of String Matching: Lower Bounds (Q3985805) (← links)
- (Q4228434) (← links)
- (Q4929407) (← links)
- String Processing and Information Retrieval (Q5393983) (← links)
- (Q5874401) (← links)
