Rchr
J-GLOBAL ID：201901007010762391
Update date: Nov. 11, 2024
Inenaga Shunsuke
Inenaga Shunsuke
Affiliation and department：
Job title：
Professor
Research field (1)：
Information theory
Research keywords (5)：
string processing
, data compression
, word combinatorics
, data structures
, algorithms
Research theme for competitive and other funds (16)：
- 2024 - 2028 辞書式圧縮と圧縮情報処理の深化
- 2022 - 2026 広義文字列のアルゴリズムと組合せ論
- 2020 - 2024 文字列の辞書式順序の組合せ論とその応用
- 2018 - 2023 情報爆縮に基づくIoTデータ処理基盤の構築
- 2019 - 2023 文字列学的手法によるシーケンシャルデータ解析
- 2017 - 2020 高度データ構造的手法に基づく文字列情報処理問題の上下界解明
- 2016 - 2020 Combinatorics of repetitive structures in strings and its applications
- 2014 - 2018 New developments in string processing based on combinatorics and advanced data structures
- 2013 - 2018 Information Implosion Foundational Technology
- 2013 - 2017 Knowledge discovery and data classification based on string compression
- 2011 - 2013 Fast parameterized pattern matching algorithms based on data compression
- 2010 - 2012 Foundational technology for light-weight XML-DBMS based on very fast compressed data stream processing
- 2009 - 2010 Parameterized string matching and its application to pattern discovery
- 2007 - 2009 Research on Design Methodology of Dependable LSI Loading Value and Trust
- 2007 - 2009 Key Technology for XML DB in Embedded Device Based on Efficient Compressed Pattern Matching
- 2005 - 2006 文字列学理論に基づいた高速知識発見システムの開発に関する基盤研究
Show all
Papers (233)：
-
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). 2024. 306. 75:1-75:15
-
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
ｍore...
Books (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
Lectures and oral presentations (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)
Awards (4)：
- 2021/01 - SOFSEM 2021 Best Paper Award
- 2020/11 - 情報処理学会60周年記念論文
- 2020/10 - SPIRE 2020 Best Paper Award
- 2008/01 - SOFSEM 2008 SRF Best Paper Award
Return to Previous Page
