Christian Charras, Thierry Lecroq, Joseph Daniel Pehoushek. A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract). In Martin Farach-Colton, editor, Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings. Volume 1448 of Lecture Notes in Computer Science, pages 55-64, Springer, 1998.
@inproceedings{CharrasLP98,
title = {A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract)},
author = {Christian Charras and Thierry Lecroq and Joseph Daniel Pehoushek},
year = {1998},
tags = {pattern matching},
researchr = {https://researchr.org/publication/CharrasLP98},
cites = {0},
citedby = {0},
pages = {55-64},
booktitle = {Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings},
editor = {Martin Farach-Colton},
volume = {1448},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64739-2},
}