Pages that link to "Item:Q3854624"
From MaRDI portal
The following pages link to The Complexity of Pattern Matching for a Random String (Q3854624):
Displayed 38 items.
- Fast and flexible packed string matching (Q405577) (← links)
- Improved and self-tuned occurrence heuristics (Q405578) (← links)
- String matching with alphabet sampling (Q414445) (← 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)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Average running time of the Boyer-Moore-Horspool algorithm (Q1190450) (← links)
- Fast average-case pattern matching by multiplexing sparse tables (Q1190461) (← links)
- Fast two-dimensional pattern matching (Q1209318) (← 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)
- Sublinear approximate string matching and biological applications (Q1336963) (← links)
- Optimal pattern matching algorithms (Q1734696) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- Geometry-based symbolic approximation for fast sequence matching on manifolds (Q1800026) (← links)
- Average complexity of exact and approximate multiple string matching (Q1885904) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Sequential and indexed two-dimensional combinatorial template matching allowing rotations (Q2576875) (← links)
- On the average-case complexity of pattern matching with wildcards (Q2672571) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Fast String Matching in Stationary Ergodic Sources (Q2785374) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
- DYNAMIC ALLOCATION OF FINITE AUTOMATA STATES FOR FAST STRING RECOGNITION (Q3421847) (← links)
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME (Q3421849) (← links)
- ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS (Q3532140) (← links)
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM (Q3655531) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- (Q5009608) (← links)
- Fast algorithms for two dimensional and multiple pattern matching (Q5056115) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
- Fast Average-Case Pattern Matching on Weighted Sequences (Q5384623) (← links)