Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to this string. The problem of finding the palindromic length drew some attention, and a few $O(n\log n)$ time online algorithms were recently designed for it. In this paper we present the first linear time online algorithm for this problem.Peer reviewe
We consider computing a longest palindrome in the streaming model, where the symbols arrive one-by-o...
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindro...
AbstractThe problem of palindrome recognition using a Turing machine with one multidimensional tape ...
Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to ...
Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to ...
Given a string s of length n over a general alphabet and an integer k, the problem is to decide whet...
We revisit the classic algorithmic problem of computing a longest palidromic substring. This problem...
International audienceWe revisit the classic algorithmic problem of computing a longest palidromic s...
Given a language L that is online recognizable in linear time and space, we construct a linear time ...
It is known that the length of the longest substring palindromes (LSPals) of a given string T of len...
AbstractThis paper presents two efficient concurrent-read concurrent-write parallel algorithms that ...
A palindrome is defined as a string which reads forwards the same as backwards, like, for example, t...
Palindromes are important objects in strings which have been extensively studied from combinatorial,...
We propose a new linear-size data structure which provides a fast access to all palindromic substrin...
AbstractIn this paper, we study the palindrome retrieval problem with the input string compressed in...
We consider computing a longest palindrome in the streaming model, where the symbols arrive one-by-o...
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindro...
AbstractThe problem of palindrome recognition using a Turing machine with one multidimensional tape ...
Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to ...
Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to ...
Given a string s of length n over a general alphabet and an integer k, the problem is to decide whet...
We revisit the classic algorithmic problem of computing a longest palidromic substring. This problem...
International audienceWe revisit the classic algorithmic problem of computing a longest palidromic s...
Given a language L that is online recognizable in linear time and space, we construct a linear time ...
It is known that the length of the longest substring palindromes (LSPals) of a given string T of len...
AbstractThis paper presents two efficient concurrent-read concurrent-write parallel algorithms that ...
A palindrome is defined as a string which reads forwards the same as backwards, like, for example, t...
Palindromes are important objects in strings which have been extensively studied from combinatorial,...
We propose a new linear-size data structure which provides a fast access to all palindromic substrin...
AbstractIn this paper, we study the palindrome retrieval problem with the input string compressed in...
We consider computing a longest palindrome in the streaming model, where the symbols arrive one-by-o...
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindro...
AbstractThe problem of palindrome recognition using a Turing machine with one multidimensional tape ...
DOI
Add to ORKG