Pages that link to "Item:Q1190450"
From MaRDI portal
The following pages link to Average running time of the Boyer-Moore-Horspool algorithm (Q1190450):
Displaying 12 items.
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- On Boyer-Moore automata (Q1336957) (← links)
- Optimal pattern matching algorithms (Q1734696) (← links)
- An algorithm to compute the character access count distribution for pattern matching algorithms (Q1736492) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees (Q2182712) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- The Boyer-Moore-Horspool heuristic with Markovian input (Q2712578) (← links)
- Algorithms in the Ultra-Wide Word Model (Q2948478) (← links)
- Regular Expressions at Their Best: A Case for Rational Design (Q3073651) (← links)
- Analysis of Boyer-Moore-Horspool string-matching heuristic (Q3122912) (← links)
