The following pages link to A fast string searching algorithm (Q3090391):
Displaying 50 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Document retrieval with one wildcard (Q287451) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- Permuted scaled matching (Q294926) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Improved and self-tuned occurrence heuristics (Q405578) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- A fast algorithm for order-preserving pattern matching (Q477704) (← links)
- String matching with lookahead (Q496556) (← links)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- Faster string matching based on hashing and bit-parallelism (Q522976) (← links)
- Fast searching in packed strings (Q533408) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- String-matching with OBDDs (Q596086) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- A fast algorithm for string matching with mismatches (Q672410) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Essence of generalized partial computation (Q808278) (← links)
- String matching over compressed text on handheld devices using tagged sub-optimal code (TSC) (Q813136) (← links)
- A complete mechanization of correctness of a string-preprocessing algorithm (Q816208) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Scaled and permuted string matching (Q834966) (← links)
- Resource scheduling with variable requirements over time (Q835625) (← links)
- Light-based string matching (Q835975) (← links)
- Accelerating Boyer-Moore searches on binary texts (Q840783) (← links)
- On obtaining the Boyer-Moore string-matching algorithm by partial evaluation (Q845710) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- Some string matching problems from bioinformatics which still need better solutions (Q876702) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- A filtration method for order-preserving matching (Q894438) (← links)
- An analysis of the Karp-Rabin string matching algorithm (Q911281) (← links)
- A fast pattern matching algorithm derived by transformational and assertional reasoning (Q911750) (← links)
- Searching for a set of correlated patterns (Q924555) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Fast pattern-matching on indeterminate strings (Q954954) (← links)
- An aggressive algorithm for multiple string matching (Q987821) (← links)
