NTTコミュニケーション科学基礎研究所 協創情報研究部 知能創発環境研究グループ
機械学習
文字列処理アルゴリズム
文字列組合せ論
Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi. "Linear time online algorithms for constructing linear-size suffix trie" Theoretical Computer Science, Vol. 1015, pp. 114765 (2024)
Takuya Mieno and Mitsuru Funakoshi. "Data Structures for Computing Unique Palindromes in Static and Non-Static Strings" Algorithmica, Vol. 86, pp. 852--873 (2024).
Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga. “Sensitivity of string compressors and repetitiveness measures” Information and Computation, Vol. 291, pp. 104999 (2023).
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. “Computing longest palindromic substring after single-character or block-wise edits” Theoretical Computer Science, Vol. 859, pp. 116-133 (2021).
Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi. "Height-bounded Lempel-Ziv encodings" Proc. 32nd Annual European Symposium on Algorithm (ESA 2024), LIPIcs Vol. 308, pp. 18:1--18:18, United Kingdom, September 2024.
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai. "Edit and Alphabet-Ordering Sensitivity of Lex-Parse" Proc. 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), LIPIcs Vol. 306, pp. 75:1--75:15, Slovakia, August 2024.
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. "Computing maximal palindromes in non-standard matching models" Proc. 35th International Workshop on Combinatorial Algorithms (IWOCA 2024), LNCS Vol. 14764, pp. 165--179, Italy, July 2024.
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige. "Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space" Proc. 35th International Workshop on Combinatorial Algorithms (IWOCA 2024), LNCS Vol. 14764, pp. 327--340, Italy, July 2024.
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, 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.
Takuya Mieno, Mitsuru Funakoshi, 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.
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.
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, 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.
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.
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, 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.
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, 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.
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.
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, 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.
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, 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.
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, 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.
舩越満，三重野琢也，中島祐人，稲永俊介，坂内英夫，竹田正幸「極大一般化回文」冬のLAシンポジウム2022，京都，2023年2月
舩越満，中島祐人，稲永俊介，坂内英夫，竹田正幸「部分文字列編集時における最長回文の計算」STRセミナー 2021，オンライン，2021年3月
舩越満，Julian Pape-Lange「非長方形畳み込み和と3-(Sub-)Cadences」情報処理学会 第181回アルゴリズム研究発表会，オンライン，2021年1月
舩越満，中島祐人，稲永俊介，坂内英夫，竹田正幸「畳み込み和ならびにビット並列を用いた縦読みパターン照合」冬のLAシンポジウム2020，京都，2020年2月
舩越満，Julian Pape-Lange「凸多角形畳み込み和を用いた 3-(Sub-)Cadences の計算」基盤(S)離散構造処理系プロジェクト 秋のワークショップ，北海道，2019年11月
舩越満，中島祐人，稲永俊介，坂内英夫，竹田正幸 「木構造上の異なる回文の列挙」春のSTRセミナー 2019，北海道，2019年3月
舩越満，中島祐人，稲永俊介，坂内英夫，竹田正幸 「トライ上の極大回文の列挙」冬のLAシンポジウム2018，京都，2019年2月
舩越満，中島祐人，稲永俊介，坂内英夫，竹田正幸 「トライ上の極大回文の列挙」基盤(S)離散構造処理系プロジェクト 秋のワークショップ，北海道，2018年11月
舩越満，中島祐人，稲永俊介，坂内英夫，竹田正幸 「1ブロック編集時の最長回文部分文字列クエリ」基盤(S)離散構造処理系プロジェクト 初夏のワークショップ，北海道，2018年7月
舩越満，中島祐人，稲永俊介，坂内英夫，竹田正幸 「1ブロック編集時の最長回文部分文字列クエリ」夏のLAシンポジウム2018，千葉，2018年7月
舩越満，中島祐人，稲永俊介，坂内英夫，竹田正幸 「1文字編集時の最長回文部分文字列クエリ」冬のLAシンポジウム2017，京都，2018年2月
「32nd Annual European Symposium on Algorithm (ESA 2024) Track B Best Paper Award」2024年9月
「STRセミナー若手奨励賞」2019年3月
「EATCS/LA Student Presentation Award」2019年2月
E-mail: mitsuru.funakoshi0000[at]gmail.com