| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Optimal LZ-End Parsing Is Hard | Bannai, Hideo et al. | 2023 |
| 2 | Computing Palindromes on a Trie in Linear Time | Mieno, Takuya et al. | 2022 |
| 3 | Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences | Funakoshi, Mitsuru et al. | 2020 |
| 4 | Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements | Funakoshi, Mitsuru et al. | 2020 |
| 5 | Faster Queries for Longest Substring Palindrome After Block Edit | Funakoshi, Mitsuru et al. | 2019 |
| 6 | Longest substring palindrome after edit | Funakoshi, Mitsuru et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |