Mikhail Rubinchik
Mikhail Rubinchik
Verified email at urfu.ru - Homepage
Title
Cited by
Cited by
Year
EERTREE: an efficient data structure for processing palindromes in strings
M Rubinchik, AM Shur
International Workshop on Combinatorial Algorithms, 321-333, 2015
352015
Palindromic length in linear time
K Borozdin, D Kosolobov, M Rubinchik, AM Shur
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
222017
Pal k is Linear Recognizable Online
D Kosolobov, M Rubinchik, AM Shur
International Conference on Current Trends in Theory and Practice of …, 2015
212015
Pal k is Linear Recognizable Online
D Kosolobov, M Rubinchik, AM Shur
International Conference on Current Trends in Theory and Practice of …, 2015
212015
EERTREE: an efficient data structure for processing palindromes in strings
M Rubinchik, AM Shur
European Journal of Combinatorics 68, 249-265, 2018
172018
Finding distinct subpalindromes online
D Kosolobov, M Rubinchik, AM Shur
arXiv preprint arXiv:1305.2540, 2013
152013
Counting palindromes in substrings
M Rubinchik, AM Shur
International Symposium on String Processing and Information Retrieval, 290-303, 2017
112017
The number of distinct subpalindromes in random words
M Rubinchik, AM Shur
Fundamenta Informaticae 145 (3), 371-384, 2016
82016
Palindromic k-factorization in pure linear time
M Rubinchik, AM Shur
arXiv preprint arXiv:2002.03965, 2020
32020
On the number of distinct subpalindromes in words
M Rubinchik, AM Shur
Proc. 3rd Russian Finnish Symp. on Discrete Mathematics. Inst. Appl. Math …, 2014
22014
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
The system can't perform the operation now. Try again later.
Articles 1–13