EERTREE: an efficient data structure for processing palindromes in strings M Rubinchik, AM Shur European Journal of Combinatorics 68, 249-265, 2018 | 66 | 2018 |
Palindromic length in linear time K Borozdin, D Kosolobov, M Rubinchik, AM Shur 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017 | 30 | 2017 |
Pal k is Linear Recognizable Online D Kosolobov, M Rubinchik, AM Shur SOFSEM 2015: Theory and Practice of Computer Science: 41st International …, 2015 | 23 | 2015 |
Finding distinct subpalindromes online D Kosolobov, M Rubinchik, AM Shur arXiv preprint arXiv:1305.2540, 2013 | 21 | 2013 |
Counting palindromes in substrings M Rubinchik, AM Shur International Symposium on String Processing and Information Retrieval, 290-303, 2017 | 19 | 2017 |
The number of distinct subpalindromes in random words M Rubinchik, AM Shur Fundamenta Informaticae 145 (3), 371-384, 2016 | 8 | 2016 |
Palindromic k-factorization in pure linear time M Rubinchik, AM Shur arXiv preprint arXiv:2002.03965, 2020 | 4 | 2020 |
On the number of distinct subpalindromes in words M Rubinchik, AM Shur Proc. 3rd Russian Finnish Symp. on Discrete Mathematics. Inst. Appl. Math …, 2014 | 2 | 2014 |
Distance Labeling for Families of Cycles AM Shur, M Rubinchik International Conference on Current Trends in Theory and Practice of …, 2024 | | 2024 |
Two problems about recovering of damaged strings MV Rubinchik, YV Gamzova Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic …, 2013 | | 2013 |
Computing The Palindromic Length Faster M Rubinchik, AM Shur | | |
Prague Stringology Conference 2013 D Kosolobov, M Rubinchik, AM Shur | | |