( en | de | ru )

 

Disambiguation of "Rubinchik, Mikhail"

Author of the publication

copydeleteadd this publication to your clipboard
Counting Palindromes in Substrings.

, and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 290-303. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mikhail Salzmann

Mikhail Dobrynin

Mikhail Karnevskiy

Mikhail Popov

Mikhail Pletyukhov

 

Other publications of authors with the same name

EERTREE: An efficient data structure for processing palindromes in strings., and . Eur. J. Comb., (2018)$Pal^k$ Is Linear Recognizable Online., , and . CoRR, (2014)The Number of Distinct Subpalindromes in Random Words., and . CoRR, (2015)Pal k is Linear Recognizable Online., , and . SOFSEM, volume 8939 of Lecture Notes in Computer Science, page 289-301. Springer, (2015)Palindromic k-Factorization in Pure Linear Time., and . MFCS, volume 170 of LIPIcs, page 81:1-81:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Finding Distinct Subpalindromes Online., , and . Stringology, page 63-69. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)Distance Labeling for Families of Cycles., and . CoRR, (2023)The Number of Distinct Subpalindromes in Random Words., and . Fundam. Informaticae, 145 (3): 371-384 (2016)Counting Palindromes in Substrings., and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 290-303. Springer, (2017)Palindromic Length in Linear Time., , , and . CPM, volume 78 of LIPIcs, page 23:1-23:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)