The following pages link to Fast searching in packed strings (Q533408):
Displaying 12 items.
- Fast and flexible packed string matching (Q405577) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- The complexity of searching a sorted array of strings (Q2817623) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- Optimal packed string matching (Q2911643) (← links)
- (Q4426347) (← links)
- Fast Packed String Matching for Short Patterns (Q5232452) (← links)
- Fast Convolutions of Packed Strings and Pattern Matching with Wildcards (Q5268397) (← links)