1. Alstrup, S., Brodal, G.S., Rauhe, T.: Pattern matching in dynamic texts. In: Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 819–828 (2000). doi: 10.1145/338219.338645
2. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: pattern matching in Z-compressed files. In: SODA, pp. 705–714 (1994)
3. Beaudry, M., McKenzie, P., Péladeau, P., Thérien, D.: Finite moniods: from word to circuit evaluation. SIAM J. Comput. 26(1), 138–152 (1997)
4. Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings. In: Randall, D. (ed.) SODA, pp. 373–389. SIAM, Philadelphia (2011)
5. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554–2576 (2005)