| No. | Title | Author | Year |
|---|---|---|---|
| 1 | {RePair} Grammars Are the Smallest Grammars for Fibonacci Words | Mieno, Takuya et al. | 2022 |
| 2 | Cartesian Tree Subsequence Matching | Oizumi, Tsubasa et al. | 2022 |
| 3 | Computing Palindromes on a Trie in Linear Time | Mieno, Takuya et al. | 2022 |
| 4 | Minimal Absent Words on Run-Length Encoded Strings | Akagi, Tooru et al. | 2022 |
| 5 | String Sanitization Under Edit Distance: Improved and Generalized | Mieno, Takuya et al. | 2021 |
| 6 | Tight Bounds on the Maximum Number of Shortest Unique Substrings | Mieno, Takuya et al. | 2017 |
| 7 | Shortest Unique Substring Queries on Run-Length Encoded Strings | Mieno, Takuya et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |