Pages that link to "Item:Q4142690"
From MaRDI portal
The following pages link to On the Worst-Case Behavior of String-Searching Algorithms (Q4142690):
Displaying 9 items.
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- An analysis of the Karp-Rabin string matching algorithm (Q911281) (← links)
- String overlaps, pattern matching, and nontransitive games (Q1149796) (← links)
- Worst-case behavior of string-searching algorithms (Q1158765) (← links)
- Average running time of the Boyer-Moore-Horspool algorithm (Q1190450) (← links)
- On Boyer-Moore automata (Q1336957) (← links)
- Optimal partial-match retrieval (Q3888510) (← links)
- (Q5009608) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
