"Tight bounds on the complexity of the Boyer-Moore string matching algorithm",
SIAM Journal of Computing, 23, 5, pp. 1075-1091, October 1994.
|abstract ;;Quote: Boyer-Moore string matching requires roughly 3n comparisons and less than 4n comparisons
ThesaHelp: references c-d (337 items)
Topic: pattern matching (42 items)
Topic: search algorithms (40 items)