Rchr
J-GLOBAL ID:201901007010762391   Update date: May. 26, 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  (15):
  • 2022 - 2026 広義文字列のアルゴリズムと組合せ論
  • 2020 - 2024 文字列の辞書式順序の組合せ論とその応用
  • 2018 - 2023 情報爆縮に基づくIoTデータ処理基盤の構築
  • 2019 - 2023 文字列学的手法によるシーケンシャルデータ解析
  • 2017 - 2020 高度データ構造的手法に基づく文字列情報処理問題の上下界解明
Show all
Papers (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
more...
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
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page