Mikhail Rubinchik

According to our database, Mikhail Rubinchik authored at least 9 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Distance Labeling for Families of Cycles.

Arseny M. Shur, Mikhail Rubinchik

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2020

Palindromic k-Factorization in Pure Linear Time.

Mikhail Rubinchik, Arseny M. Shur

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2018

EERTREE: An efficient data structure for processing palindromes in strings.

Mikhail Rubinchik, Arseny M. Shur

Eur. J. Comb., 2018

2017

Counting Palindromes in Substrings.

Mikhail Rubinchik, Arseny M. Shur

Proceedings of the String Processing and Information Retrieval, 2017

Palindromic Length in Linear Time.

Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

The Number of Distinct Subpalindromes in Random Words.

Mikhail Rubinchik, Arseny M. Shur

Fundam. Informaticae, 2016

2015

Pal k is Linear Recognizable Online.

Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

$\mathrm{Pal}^k$ Is Linear Recognizable Online.

Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur

CoRR, 2014

2013

Finding Distinct Subpalindromes Online.

Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013