Mikhail Rubinchik

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 8

Top Topics

Picture Languages

Top Venues

Fundam. Informaticae

Publications

Arseny M. Shur, Mikhail Rubinchik
Distance Labeling for Families of Cycles. SOFSEM (2024)
Arseny M. Shur, Mikhail Rubinchik
Distance Labeling for Families of Cycles. CoRR (2023)
Mikhail Rubinchik, Arseny M. Shur
Palindromic k-Factorization in Pure Linear Time. MFCS (2020)
Mikhail Rubinchik, Arseny M. Shur
Palindromic k-Factorization in Pure Linear Time. CoRR (2020)
Mikhail Rubinchik, Arseny M. Shur
EERTREE: An efficient data structure for processing palindromes in strings. Eur. J. Comb. 68 (2018)
Mikhail Rubinchik, Arseny M. Shur
Counting Palindromes in Substrings. SPIRE (2017)
Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Palindromic Length in Linear Time. CPM (2017)
Mikhail Rubinchik, Arseny M. Shur
The Number of Distinct Subpalindromes in Random Words. Fundam. Informaticae 145 (3) (2016)
Mikhail Rubinchik, Arseny M. Shur
The Number of Distinct Subpalindromes in Random Words. CoRR (2015)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Pal k is Linear Recognizable Online. SOFSEM (2015)
Mikhail Rubinchik, Arseny M. Shur
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings. IWOCA (2015)
Mikhail Rubinchik, Arseny M. Shur
Eertree: An Efficient Data Structure for Processing Palindromes in Strings. CoRR (2015)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
$\mathrm{Pal}^k$ Is Linear Recognizable Online. CoRR (2014)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Finding Distinct Subpalindromes Online. Stringology (2013)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Finding Distinct Subpalindromes Online CoRR (2013)