舩越満 (Mitsuru Funakoshi) - マイポータル

基本情報

所属: 日本電信電話株式会社 NTTコミュニケーション科学基礎研究所研究員

研究者番号: 00987373
ORCID iD: https://orcid.org/0000-0002-2547-1509
J-GLOBAL ID: 202301019270678379
researchmap会員ID: R000055083

外部リンク: https://sites.google.com/view/m-funa0000/HOME

論文

Edit and Alphabet-Ordering Sensitivity of Lex-Parse

Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai

Proc. 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) 306 75:1-75:15 2024年8月23日査読有り
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space

Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige

Lecture Notes in Computer Science 327-340 2024年6月22日
Computing Maximal Palindromes in Non-standard Matching Models

Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

IWOCA 165-179 2024年
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings

Takuya Mieno, Mitsuru Funakoshi

Algorithmica 2023年8月30日
Optimal LZ-End Parsing Is Hard

Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno

Proc. 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023) 3-11 2023年6月21日査読有り
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie.

Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto 0001, Mitsuru Funakoshi

CoRR abs/2301.04295 2023年
Sensitivity of string compressors and repetitiveness measures

Akagi, T., Funakoshi, M., Inenaga, S.

Information and Computation 291 2023年3月
Computing Palindromes on a Trie in Linear Time

Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga

Leibniz International Proceedings in Informatics, LIPIcs 248 2022年12月1日
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings

Takuya Mieno, Mitsuru Funakoshi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13270 LNCS 425-438 2022年
Computing longest palindromic substring after single-character or block-wise edits

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science 859 116-133 2021年3月6日
Minimal Unique Palindromic Substrings After Single-Character Substitution

Funakoshi, M., Mieno, T.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12944 LNCS 33-46 2021年
A Separation of γ and b via Thue–Morse Words

Bannai, H., Funakoshi, M., I, T., K{\"o}ppl, D., Mieno, T., Nishimoto, T.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12944 LNCS 167-178 2021年
On the Approximation Ratio of LZ-End to LZ77

Ideue, T., Mieno, T., Funakoshi, M., Nakashima, Y., Inenaga, S., Takeda, M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12944 LNCS 114-126 2021年
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara

Leibniz International Proceedings in Informatics, LIPIcs 161 2020年6月1日
Non-rectangular convolutions and (sub-)cadences with three elements

Mitsuru Funakoshi, Julian Pape-Lange

Leibniz International Proceedings in Informatics, LIPIcs 154 2020年3月
Faster queries for longest substring palindrome after block edit

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Leibniz International Proceedings in Informatics, LIPIcs 128 2019年6月1日
Computing maximal palindromes and distinct palindromes in a trie

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proceedings of the Prague Stringology Conference, PSC 2019 3-15 2019年
Longest substring palindrome after edit

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Leibniz International Proceedings in Informatics, LIPIcs 105 121-1214 2018年5月1日

共同研究・競争的資金等の研究課題

編集操作に対応した動的な文字列処理アルゴリズムの開発

日本学術振興会科学研究費助成事業特別研究員奨励費 2020年4月 - 2023年3月

舩越満

舩越満

基本情報

論文

共同研究・競争的資金等の研究課題

メニュー

共著者の一覧