Reverse-Colussi

Combination of Colussi and Boyer-Moore. It works in linear time and performs at most $2n$ character inspections.

Appeared in:

• [30]: Colussi, L.: Fastest pattern matching in strings. J. Algorithms 16(2), 163–189 (1994), http://dx.doi.org/10.1006/jagm.1994.1008 ↗