Pages that link to "Item:Q2712578"
From MaRDI portal
The following pages link to The Boyer-Moore-Horspool heuristic with Markovian input (Q2712578):
Displaying 7 items.
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Average running time of the Boyer-Moore-Horspool algorithm (Q1190450) (← links)
- Optimal pattern matching algorithms (Q1734696) (← links)
- An algorithm to compute the character access count distribution for pattern matching algorithms (Q1736492) (← links)
- Heuristics as Markov chains (Q2350029) (← links)
- Analysis of Boyer-Moore-Horspool string-matching heuristic (Q3122912) (← links)
- Average case analysis of the Boyer‐Moore algorithm (Q5486324) (← links)