Yuto Nakashima

Profile Information

Affiliation: Assistant Professor, Faculty of Information Science and Electrical Engineering, Department of Informatics, Kyushu University

Degree: 博士（情報科学）(九州大学)

J-GLOBAL ID: 201901003089483500
researchmap Member ID: B000370339

Research Interests

Research Areas

Informatics / Information theory /

Research History

Apr, 2017 - Present

Faculty of Information Science and Electrical Engineering, Department of Informatics, Kyushu University
Apr, 2016 - Mar, 2017

特別研究員（DC2）, 日本学術振興会

Education

Apr, 2015 - Mar, 2017

Department of Informatics, Graduate School of Information Science and Electrical Engineering, Kyushu University
Apr, 2012 - Mar, 2014

Department of Informatics, Graduate School of Information Science and Electrical Engineering, Kyushu University
Apr, 2008 - Mar, 2012

Department of Physics, School of Sciences, Kyushu University

Committee Memberships

Jan, 2023 - Present

Secretary, EATCS Japan Chapter
Jun, 2022 - Present

編集委員, 電子情報通信学会情報・システムソサイエティ誌編集委員会
Apr, 2022 - Present

運営委員, 情報処理学会アルゴリズム研究運営委員会
Jun, 2020 - Present

専門委員, 電子情報通信学会コンピュテーション研究専門委員会
2020 - 2021

member, 32nd International Symposium on Algorithms and Computation: Local organizing committee
2015 - 2016

member, 23rd International Symposium on String Processing and Information Retrieval: Local organizing committee

Awards

Oct, 2020

Best Paper Award for SPIRE 2020, On Repetitiveness Measures of Thue-Morse Words

Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Feb, 2017

6th LA/EATCS-Japan Student Presentation Award

Yuto Nakashima
Jan, 2015

4th LA/EATCS-Japan Student Paper Award

Yuto Nakashima

Papers

Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings

Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai

String Processing and Information Retrieval, 331-344, Sep 20, 2023
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph.

Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue

SPIRE, 28-34, 2023
On Sensitivity of Compact Directed Acyclic Word Graphs.

Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga

WORDS, 168-180, 2023 Peer-reviewed
Optimal LZ-End Parsing Is Hard.

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

CPM, 3-11, 2023 Peer-reviewed
Space-Efficient STR-IC-LCS Computation.

Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai

SOFSEM, 372-384, 2023 Peer-reviewed
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches

Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda

Theoretical Computer Science, 933 21-42, Oct, 2022 Peer-reviewed
Combinatorics of minimal absent words for a sliding window

Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science, 927 109-119, Jun, 2022 Peer-reviewed
Minimal Absent Words on Run-Length Encoded Strings.

Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga

CPM, 27-17, 2022 Peer-reviewed
Factorizing Strings into Repetitions.

Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theory Comput. Syst., 66(2) 484-501, 2022 Peer-reviewed
c-trie++: A dynamic trie tailored for fast prefix searches.

Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Inf. Comput., 285(Part) 104794-104794, 2022 Peer-reviewed
Computing Minimal Unique Substrings for a Sliding Window.

Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Algorithmica, 84(3) 670-693, 2022 Peer-reviewed
Palindromic trees for a sliding window and its applications.

Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Information Processing Letters, 173 106174-106174, 2022 Peer-reviewed
Efficiently computing runs on a trie

Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science, 887 143-151, Oct, 2021 Peer-reviewed
Counting Lyndon Subsequence

Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda

Proc. of the Prague Stringology Conference 2021 (PSC 2021), abs/2106.01190 53-60, Aug, 2021 Peer-reviewed
Compressed Communication Complexity of Hamming Distance

Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Algorithms, 14(4) 116-116, Apr 3, 2021 Peer-reviewed
Computing longest palindromic substring after single-character or block-wise edits.

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

Theor. Comput. Sci., 859 116-133, Mar, 2021 Peer-reviewed
Position Heaps for Cartesian-Tree Matching on Strings and Tries.

Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga

Proc. of 28th International Symposium in String Processing and Information Retrieval (SPIRE 2021), 241-254, 2021 Peer-reviewed
On the Approximation Ratio of LZ-End to LZ77.

Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda

Proc. of 28th International Symposium in String Processing and Information Retrieval (SPIRE 2021), 114-126, 2021 Peer-reviewed
Longest Common Rollercoasters.

Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. of 28th International Symposium in String Processing and Information Retrieval (SPIRE 2021), 21-32, 2021 Peer-reviewed
Grammar Index by Induced Suffix Sorting

Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. of 28th International Symposium in String Processing and Information Retrieval (SPIRE 2021), 85-99, 2021 Peer-reviewed

Presentations

Lyndon文字列とテキスト圧縮

中島祐人

2018年電子情報通信学会総合大会 COMP-ELC学生シンポジウム, Mar, 2018 Invited

Teaching Experience

Research Projects

広義文字列のアルゴリズムと組合せ論

科学研究費助成事業基盤研究(B), 基盤研究(B), 日本学術振興会, Apr, 2022 - Mar, 2026

稲永俊介, 坂内英夫, Koeppl Dominik, 中島祐人
辞書式順序依存問題の複雑さの解明

科学研究費助成事業学術変革領域研究(A), 学術変革領域研究(A), 日本学術振興会, Apr, 2023 - Mar, 2025

中島祐人
Lyndon文字列による反復性指標解析

科学研究費助成事業若手研究, 若手研究, 日本学術振興会, Apr, 2021 - Mar, 2025

中島祐人
情報爆縮に基づくIoTデータ処理基盤の構築

科学研究費助成事業基盤研究(A), 基盤研究(A), 日本学術振興会, Apr, 2018 - Mar, 2023

竹田正幸, 定兼邦彦, 坂内英夫, 井智弘, 瀧本英二, 坂本比呂志, 畑埜晃平, 稲永俊介, 喜田拓也, 中島祐人
Development of string data processing method using lexicographic orders

Strategic Basic Research Program, ACT-X, Japan Science and Technology Agency, Nov, 2020 - Mar, 2023
Simple and fast string algorithms by Lyndon words

Grants-in-Aid for Scientific Research, Grant-in-Aid for Early-Career Scientists, Japan Society for the Promotion of Science, Apr, 2018 - Mar, 2021

Nakashima Yuto
ストリーミングモデルにおける文字列処理アルゴリズム基盤

科学研究費助成事業研究活動スタート支援, 研究活動スタート支援, 日本学術振興会, Aug, 2017 - Mar, 2019

中島祐人
ストリーム処理のための文字列組合せ論

科学研究費助成事業特別研究員奨励費, 特別研究員奨励費, 日本学術振興会, Apr, 2016 - Mar, 2018

中島祐人
Information Implosion Foundational Technology

Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (A), Grant-in-Aid for Scientific Research (A), Japan Society for the Promotion of Science, Apr, 2013 - Mar, 2018

Takeda Masayuki

Profile Information

Research Interests

Research Areas

Research History

Education

Committee Memberships

Awards

Papers

Presentations

Teaching Experience

Research Projects

Menu

Coauthors