Mikhail Rubinchik
Mikhail Rubinchik
Подтвержден адрес электронной почты в домене urfu.ru - Главная страница
Название
Процитировано
Процитировано
Год
EERTREE: an efficient data structure for processing palindromes in strings
M Rubinchik, AM Shur
International Workshop on Combinatorial Algorithms, 321-333, 2015
272015
Pal k is Linear Recognizable Online
D Kosolobov, M Rubinchik, AM Shur
International Conference on Current Trends in Theory and Practice of …, 2015
202015
Pal k is Linear Recognizable Online
D Kosolobov, M Rubinchik, AM Shur
International Conference on Current Trends in Theory and Practice of …, 2015
202015
Palindromic length in linear time
K Borozdin, D Kosolobov, M Rubinchik, AM Shur
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
152017
Finding distinct subpalindromes online
D Kosolobov, M Rubinchik, AM Shur
arXiv preprint arXiv:1305.2540, 2013
142013
EERTREE: an efficient data structure for processing palindromes in strings
M Rubinchik, AM Shur
European Journal of Combinatorics 68, 249-265, 2018
112018
The number of distinct subpalindromes in random words
M Rubinchik, AM Shur
Fundamenta Informaticae 145 (3), 371-384, 2016
82016
Counting palindromes in substrings
M Rubinchik, AM Shur
International Symposium on String Processing and Information Retrieval, 290-303, 2017
62017
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
Palindromic k-Factorization in Pure Linear Time
M Rubinchik, AM Shur
arXiv preprint arXiv:2002.03965, 2020
2020
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, PDF PostScript
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–13