1. Efficient string matching: An aid to bibliographic search;Aho;Commun. ACM,1975
2. Sorting in linear time?;Andersson;J. Comput. System Sci.,1998
3. On economical construction of the transitive closure of a directed graph;Arlazarov;Soviet Math. Dokl.,1970
4. D. Belazzougui, Succinct dictionary matching with no slowdown, in: CPM, 2010, pp. 88–100.
5. O. Ben-kiki, P. Bille, D. Breslauer, R. Grossi, O. Weimann, Optimal packed string matching, in: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011.