稲永俊介

Inenaga Shunsuke

所属機関・部署：
職名：教授

研究分野 (1件)：情報学基礎論

研究キーワード (5件)：文字列処理 , データ圧縮 , 文字列組合せ論 , データ構造 , アルゴリズム

競争的資金等の研究課題 (15件)：

全件表示

論文 (232件)：

Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai. Faster space-efficient STR-IC-LCS computation. Theoretical Computer Science. 2024. 1003. 114607-114607
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai. Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. String Processing and Information Retrieval. 2023. 331-344
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue. Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE2023. 2023. 28-34
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theoretical Computer Science. 2023. 973. 114093-114093
Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga. On Sensitivity of Compact Directed Acyclic Word Graphs. WORDS 2023. 2023

書籍 (4件)：

Combinatorial Methods for String Processing
2021
String Processing and Information Retrieval (SPIRE 2016)
Springer LNCS 9954 2016
pecial issue of Language and Automata Theory and Applications 2011 (LATA 2011)
Taylor & Francis, International Journal of Computer Mathematics, 90(6) 2013
Language and Automata Theory and Applications 2011 (LATA 2011)
Springer LNCS 6638 2011

講演・口頭発表等 (2件)：

Combinatorial algorithms for grammar-based text compression
(Tutorial on Combinatorial Methods for String and Graph (followed by WALCOM 2020) 2020)
Faster Longest Common Extension on Compressed Strings and Applications
(PSC 2015 2015)

受賞 (4件)：

※　J-GLOBALの研究者情報は、researchmapの登録情報に基づき表示しています。登録・更新については、こちらをご覧ください。

稲永 俊介