Pages that link to "Item:Q3048242"
From MaRDI portal
The following pages link to On improving the worst case running time of the Boyer-Moore string matching algorithm (Q3048242):
Displaying 19 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← links)
- A variation on the Boyer-Moore algorithm (Q1190458) (← links)
- Constant-space string-matching in sublinear average time (Q1292492) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- On Boyer-Moore automata (Q1336957) (← links)
- A faster quick search algorithm (Q1736618) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Complexity of substring search in a set of strings (Q1791617) (← links)
- Time-space-optimal string matching (Q1838329) (← links)
- On-line string matching algorithms: survey and experimental results (Q2720122) (← links)
- Periodicity and Repetitions in Parameterized Strings (Q3439251) (← links)
- Parallel String Matching Algorithms (Q3814826) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
