Mikhail Rubinchik

16 papers B 4C 2Misc 1Journal 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
Distance labeling for families of cycles.
Acta Informatica
Arseny M. Shur, Mikhail Rubinchik
2024 B conf
Distance Labeling for Families of Cycles.
SOFSEM
Arseny M. Shur, Mikhail Rubinchik
2023 J jnl
Distance Labeling for Families of Cycles.
CoRR
Arseny M. Shur, Mikhail Rubinchik
2020 B conf
Palindromic k-Factorization in Pure Linear Time.
MFCS
Mikhail Rubinchik, Arseny M. Shur
2020 J jnl
Palindromic k-Factorization in Pure Linear Time.
CoRR
Mikhail Rubinchik, Arseny M. Shur
2018 J jnl
EERTREE: An efficient data structure for processing palindromes in strings.
Eur. J. Comb.
Mikhail Rubinchik, Arseny M. Shur
2017 C conf
Counting Palindromes in Substrings.
SPIRE
Mikhail Rubinchik, Arseny M. Shur
2017 B conf
Palindromic Length in Linear Time.
CPM
Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2016 J jnl
The Number of Distinct Subpalindromes in Random Words.
Fundam. Informaticae
Mikhail Rubinchik, Arseny M. Shur
2015 C conf
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings.
IWOCA
Mikhail Rubinchik, Arseny M. Shur
2015 J jnl
Eertree: An Efficient Data Structure for Processing Palindromes in Strings.
CoRR
Mikhail Rubinchik, Arseny M. Shur
2015 B conf
Pal k is Linear Recognizable Online.
SOFSEM
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2015 J jnl
The Number of Distinct Subpalindromes in Random Words.
CoRR
Mikhail Rubinchik, Arseny M. Shur
2014 J jnl
$\mathrm{Pal}^k$ Is Linear Recognizable Online.
CoRR
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2013 J jnl
Finding Distinct Subpalindromes Online
CoRR
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2013 Misc conf
Finding Distinct Subpalindromes Online.
PSC
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur