Pages that link to "Item:Q3985805"
From MaRDI portal
The following pages link to On the Exact Complexity of String Matching: Lower Bounds (Q3985805):
Displaying 17 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- \(k\) one-way heads cannot do string-matching (Q676454) (← links)
- On Simon's string searching algorithm (Q685473) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Light-based string matching (Q835975) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Exact bounds on the complexity of sequential string matching algorithms (Q1326953) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- On a conjecture on bidimensional words. (Q1874389) (← links)
- Lower bounds of temporal and spatial complexity of the substring search problem (Q2629755) (← links)
- The exact online string matching problem: a review of the most recent results (Q2875102) (← links)
- (Q4228434) (← links)
- On the lower bound for parallel string matching (Q4844575) (← links)
- (Q4929407) (← links)
- (Q5874401) (← links)
