Faster subsequence recognition in compressed strings
A. Tiskin

This publication is cited in the following articles:

1. Zdenek Tronicek, “Fast algorithms for window accumulated subsequence matching problem”, Acta Informatica, 63:1 (2026)  
2. Alexander Tiskin, Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, 479  
3. Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Kunnemann, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, 192  
4. Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, “Compressed Subsequence Matching and Packed Tree Coloring”, Algorithmica, 77:2 (2017), 336  
5. Alexander Tiskin, “Fast Distance Multiplication of Unit-Monge Matrices”, Algorithmica, 71:4 (2015), 859  
6. Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Lecture Notes in Computer Science, 8486, Combinatorial Pattern Matching, 2014, 40  
7. I. S. Burmistrov, A. V. Kozlova, E. B. Kurpilyansky, A. A. Khvorost, “Efficient data compression by straight-line programs”, J. Math. Sci. (N. Y.), 192:3 (2013), 282–294      
8. Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Lecture Notes in Computer Science, 6661, Combinatorial Pattern Matching, 2011, 309  
9. Alexander Tiskin, Lecture Notes in Computer Science, 6651, Computer Science – Theory and Applications, 2011, 401  
10. Tiskin A., “Fast distance multiplication of unit-Monge matrices”, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings in Applied Mathematics, 135, 2010, 1287–1296