11 citations · 22 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020
Palindromic k-Factorization in Pure Linear Time
Mikhail Rubinchik, Arseny M. Shur
Given a string of length over a general alphabet and an integer , the problem is to decide whether is a concatenation of nonempty palindromes. Two previously kno…
cs.DS2015
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
Mikhail Rubinchik, Arseny M. Shur
We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the…
cs.DS2013★ 11 cited
Finding Distinct Subpalindromes Online
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
We exhibit an online algorithm finding all distinct palindromes inside a given string in time over an ordered alphabet and in time over an unordered alphabe…