Mitsuru Funakoshi

Affiliation

• Learning and Intelligent Systems Research Group, Innovative Communication Laboratory, NTT Communication Science Laboratories

Research Interests

• Machine Learning

• String Processing Algorithms

• Combinatorics on Strings

Journal papers (reviewed)

1. Takuya Mieno and Mitsuru Funakoshi. "Data Structures for Computing Unique Palindromes in Static and Non-Static Strings" Algorithmica (2023).

2. Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga. “Sensitivity of string compressors and repetitiveness measures” Information and Computation, Vol. 291, pp. 104999 (2023).

3. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. “Computing longest palindromic substring after single-character or block-wise edits” Theoretical Computer Science, Vol. 859, pp. 116-133 (2021).

Conference proceedings (reviewed)

1. Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, and Takeaki Uno. "Optimal LZ-End Parsing is Hard" Proc. 34th Annual Symposium on Combinatorial Pattern Matching (CPM2023), LIPIcs Vol. 259, pp. 3:1--3:11, France, June 2023.

2. Takuya Mieno, Mitsuru Funakoshi, and Shunsuke Inenaga. "Computing Palindromes on a Trie in Linear Time" Proc. 33rd International Symposium on Algorithms and Computation (ISAAC 2022), LIPIcs Vol. 248, pp. 15:1-15:15, Korea, December 2022.

3. Takuya Mieno and Mitsuru Funakoshi. "Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings" Proc. 33rd International Workshop on Combinatorial Algorithms (IWOCA 2022), LNCS Vol. 13270, pp. 425-438, Germany, June 2022.

4. Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, and Takaaki Nishimoto. "A separation of γ and b via Thue−Morse Words" Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021), LNCS Vol. 12944, pp. 167-178, France, October 2021.

5. Mitsuru Funakoshi and Takuya Mieno. "Minimal unique palindromic substrings after single-character substitution" Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021), LNCS Vol. 12944, pp. 33-46, France, October 2021.

6. Takumi Ideue,  Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, and Masayuki Takeda. "On the Approximation Ratio of LZ-End to LZ77" Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021), LNCS Vol. 12944, pp. 114-126, France, October 2021.

7. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, and Ayumi Shinohara. “Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences”  Proc. 31st Annual Symposium on Combinatorial Pattern Matching (CPM2020), LIPIcs Vol.161, pp. 12:1-12:11, Denmark, June 2020.

8. Mitsuru Funakoshi and Julian Pape-Lange. “Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements” Proc. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), LIPIcs Vol.154, pp. 30:1–30:16, France, March 2020.

9. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. “Computing Maximal Palindromes and Distinct Palindromes in a Trie” Proc. The Prague Stringology Conference 2019 (PSC 2019), pp. 3-15, Czech Republic, August 2019.

10. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. “Faster queries for longest substring palindrome after block edit” Proc. 30th Annual Symposium on Combinatorial Pattern Matching (CPM2019), LIPIcs Vol.128, pp. 27:1-27:13, Italy, June 2019.

11. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. “Longest substring palindrome after edit” Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM2018), LIPIcs Vol.105, pp. 12:1-12:14, China, July 2018. 

Award

• EATCS/LA Student Presentation Award (February, 2019)

Links

• dblp

• arXiv

• Google Scholar

• ORCID 

Contact

E-mail: mitsuru.funakoshi0000[at]gmail.com