author T. Lecroq

[17]  T. Lecroq. A variation on the Boyer-Moore algorithm. Theor. Comput. Sci., vol.92, n.1, pp.119--144, (1992).
[22]  M. Crochemore and A. Czumaj and L. Gcasieniec and S. Jarominek and T. Lecroq and W. Plandowski and W. Rytter. Speeding up two string matching algorithms. Algorithmica, vol.12, n.4/5, pp.247--267, (1994).
[26]  C. Charras and T. Lecroq and J. D. Pehoushek. A Very Fast String Matching Algorithm for Small Alphabets and Long Patterns. Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, n.1448, pp.55--64, Springer-Verlag, Berlin, rutgers, (1998).
[44]  T. Lecroq. Fast exact string matching algorithms. ipl, vol.102, n.6, pp.229--235, Elsevier North-Holland, Inc., Amsterdam, The Netherlands, The Netherlands, (2007).
[49]  S. Faro and T. Lecroq. Efficient Variants of the Backward-Oracle-Matching Algorithm. Proceedings of the Prague Stringology Conference 2008, pp.146--160, Czech Technical University in Prague, Czech Republic, (2008).
[62]  S. Faro and T. Lecroq. A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. Experimental Algorithms - 11th International Symposium, SEA 2012, Lecture Notes in Computer Science, n.7276, pp.172--183, Springer-Verlag, Berlin, (2012).
[63]  S. Faro and T. Lecroq. A Fast Suffix Automata Based Algorithm for Exact Online String Matching. Implementation and Application of Automata - 17th International Conference, CIAA 2012, Lecture Notes in Computer Science, n.7381, pp.149--158, Springer-Verlag, Berlin, (2012).