| Sensitivity of string compressors and repetitiveness measures T Akagi, M Funakoshi, S Inenaga Information and Computation 291, 104999, 2023 | 32 | 2023 |
| Longest substring palindrome after edit M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 12: 1-12: 14, 2018 | 14 | 2018 |
| Computing longest palindromic substring after single-character or block-wise edits M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda Theoretical Computer Science 859, 116-133, 2021 | 11 | 2021 |
| A Separation of and b via Thue–Morse Words H Bannai, M Funakoshi, T I, D Köppl, T Mieno, T Nishimoto International Symposium on String Processing and Information Retrieval, 167-178, 2021 | 9 | 2021 |
| Computing Maximal Palindromes and Distinct Palindromes in a Trie. M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda Stringology, 3-15, 2019 | 8 | 2019 |
| Faster queries for longest substring palindrome after block edit M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda arXiv preprint arXiv:1901.10722, 2019 | 8 | 2019 |
| Optimal LZ-end parsing is hard H Bannai, M Funakoshi, K Kurita, Y Nakashima, K Seto, T Uno arXiv preprint arXiv:2302.02586, 2023 | 7 | 2023 |
| On the approximation ratio of LZ-End to LZ77 T Ideue, T Mieno, M Funakoshi, Y Nakashima, S Inenaga, M Takeda International Symposium on String Processing and Information Retrieval, 114-126, 2021 | 6 | 2021 |
| Minimal unique palindromic substrings after single-character substitution M Funakoshi, T Mieno String Processing and Information Retrieval: 28th International Symposium …, 2021 | 6 | 2021 |
| Non-rectangular convolutions and (sub-) cadences with three elements M Funakoshi, J Pape-Lange arXiv preprint arXiv:1910.11564, 2019 | 5 | 2019 |
| Height-bounded lempel-ziv encodings H Bannai, M Funakoshi, D Hendrian, M Matsuda, SJ Puglisi arXiv preprint arXiv:2403.08209, 2024 | 4 | 2024 |
| Detecting -(Sub-)Cadences and Equidistant Subsequence Occurrences M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda, ... arXiv preprint arXiv:2002.06796, 2020 | 4 | 2020 |
| Computing minimal absent words and extended bispecial factors with CDAWG space S Inenaga, T Mieno, H Arimura, M Funakoshi, Y Fujishige International Workshop on Combinatorial Algorithms, 327-340, 2024 | 3 | 2024 |
| Linear time online algorithms for constructing linear-size suffix trie D Hendrian, T Takagi, S Inenaga, K Goto, M Funakoshi Theoretical Computer Science 1015, 114765, 2024 | 2 | 2024 |
| Computing Maximal Palindromes in Non-standard Matching Models M Funakoshi, T Mieno, Y Nakashima, S Inenaga, H Bannai, M Takeda International Workshop on Combinatorial Algorithms, 165-179, 2024 | 2 | 2024 |
| Computing palindromes on a trie in linear time T Mieno, M Funakoshi, S Inenaga arXiv preprint arXiv:2211.03995, 2022 | 2 | 2022 |
| Shortest unique palindromic substring queries in semi-dynamic settings T Mieno, M Funakoshi International Workshop on Combinatorial Algorithms, 425-438, 2022 | 2 | 2022 |
| Data structures for computing unique palindromes in static and non-static strings T Mieno, M Funakoshi Algorithmica 86 (3), 852-873, 2024 | 1 | 2024 |
| Computing maximal palindromes in non-standard matching models T Mieno, M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda Information and Computation, 105283, 2025 | | 2025 |
| Computing palindromes and suffix trees of dynamic trees M Funakoshi, T Mieno, Y Nakashima, S Inenaga, H Bannai, M Takeda | | 2024 |
Shunsuke InenagaProfessor, Department of Informatics, Kyushu Universityยืนยันอีเมลแล้วที่ inf.kyushu-u.ac.jp
