柴田 紘希（Hiroki Shibata）

Japanese / English

Profile

所属

研究分野

略歴

Publications

2026

  1. [j2]

    Taketo Tsujimoto, Yuki Yonemoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga: Subsequence Matching and LCS under Cartesian-Tree Equivalence. Theory of Computing Systems, Vol. 70, Article 7. [DOI]

  2. [j1]

    Hiroki Shibata, Dominik Köppl: LZ78 Substring Compression in Compressed Space. Theory of Computing Systems, Vol. 70, Article 1. [DOI]

  3. [c10]

    Haruki Umezaki, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga: Compact Enumeration of Maximal Closed Substrings in Run-Length Encoded Strings. 33rd International Symposium on String Processing and Information Retrieval (SPIRE 2026). [DOI]

  4. [c9]

    Hiroki Shibata, Haruki Umezaki, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga: Online computation of maximal closed substrings. 33rd International Symposium on String Processing and Information Retrieval (SPIRE 2026). [DOI] [slides]

  5. [c8]

    Hiroki Shibata, Takuya Mieno, Dominik Köppl, Shunsuke Inenaga: Relaxation of Square-Freeness. Prague Stringology Conference 2026 (PSC 2026). [proceedings] [slides]

  6. [c7]

    Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga: LZBE: An LZ-Style Compressor Supporting O(log n)-Time Random Access. 37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026). Best Paper Award Honorable Mention. [DOI] [slides]

  7. [p13]

    Nikolai Chukhin, Rishikesh Gajjala, Juha Harviainen, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Shibata, Alexander V. Smal: The Greedy Superstring Conjecture Is False. arXiv. [DOI]

    Hiroki Shibata: Disproving the Greedy Superstring Conjecture. arXiv. [this version]

  8. [p12]

    Hiroki Shibata, Hideo Bannai: String Representation Based on Substring Equation Systems. arXiv. [DOI]

    Hiroki Shibata, Hideo Bannai: String Representation in Suffixient Set Size Space. arXiv. [this version]

  9. [p11]

    Hiroki Shibata, Yuto Fujie: Sensitivity and Size Relationships of the Lempel-Ziv Factorization. arXiv. [DOI]

  10. [p10]

    Hiroki Shibata, Haruki Umezaki, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga: Online computation of maximal closed substrings. arXiv. [DOI]

  11. [p9]

    Haruki Umezaki, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga: Compact Enumeration of Maximal Closed Substrings in Run-Length Encoded Strings. arXiv. [DOI]

  12. [p8]

    Hiroki Shibata, Takuya Mieno, Dominik Köppl, Shunsuke Inenaga: Relaxation of Square-Freeness. arXiv. [DOI]

  13. [p7]

    Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai: Counting Distinct (Non-)Crossing Substrings in Optimal Time. arXiv. [DOI]

    Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai: Counting distinct (non-)crossing substrings. arXiv. [this version]

  14. [p6]

    Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno, Masakazu Ishihata, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Online Computation of Palindromes and Suffix Trees on Tries. arXiv. [DOI]

  15. [p5]

    Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga: LZBE: an LZ-style compressor supporting O(log n)-time random access. arXiv. [DOI]

    Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga: LZSE: an LZ-style compressor supporting O(log n)-time random access. arXiv. [this version]

  16. [r10]

    柴田 紘希, 梅崎 陽生, 中島 祐人, 稲永 俊介: 極大閉部分文字列のオンライン計算アルゴリズム. 第206回 情報処理学会アルゴリズム研究発表会. [link] [slides]

  17. [r9]

    柴田 紘希, 坂内 英夫: 部分文字列方程式による文字列表現. 2026年夏のLAシンポジウム. [link] [slides]

  18. [t9]

    部分文字列方程式と双方向スキームの相互変換. STRセミナー2026. [link] [slides]

  19. [t8]

    Online computation of maximal closed substrings. Sequences in London 2026. [link] [slides]

2025

  1. [c6]

    Yuto Fujie, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga: Tight Additive Sensitivity on LZ-Style Compressors and String Attractors. 32nd International Symposium on String Processing and Information Retrieval (SPIRE 2025). [DOI]

  2. [c5]

    Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai: Counting Distinct (Non-)crossing Substrings. 32nd International Symposium on String Processing and Information Retrieval (SPIRE 2025). [DOI]

  3. [c4]

    Alan Cleary, Joseph Winjum, Jordan Dood, Hiroki Shibata, Shunsuke Inenaga: Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access. 23rd International Symposium on Experimental Algorithms (SEA 2025). [DOI] [slides]

  4. [c3]

    Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga: Packed Acyclic Deterministic Finite Automata. 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025). [DOI] [slides]

  5. [p4]

    Taketo Tsujimoto, Yuki Yonemoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga: Subsequence Matching and LCS under Cartesian-Tree Equivalence. arXiv. [DOI]

    Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga: Computing Longest Common Subsequence under Cartesian-Tree Matching Model. arXiv. [this version]

  6. [p3]

    Hiroki Shibata, Dominik Köppl: LZ78 Substring Compression in Compressed Space. arXiv. [DOI]

  7. [p2]

    Yuto Fujie, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga: Tight Additive Sensitivity on LZ-style Compressors and String Attractors. arXiv. [DOI]

  8. [r8]

    柴田 紘希, 中島 祐人, 山口 勇太郎, 稲永 俊介: LZ-Start-End圧縮. 第204回 情報処理学会アルゴリズム研究発表会. [link] [slides]

  9. [r7]

    Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga: LZSE: an LZ-style compressor supporting O(log n)-time random access. The 25th Korea-Japan Joint Workshop (WAAC 2025). [link] [slides]

  10. [t7]

    5th place solution: Compressed Code Golf Techniques. The 2025 Google Code Golf Championship (NeurIPS 2025 Competition Track). [link] [slides]

  11. [t6]

    貪欲LZ-Start-End分解の線形時間アルゴリズム. STRセミナー2025. [link] [slides]

2024

  1. [c2]

    Hiroki Shibata, Dominik Köppl: LZ78 Substring Compression with CDAWGs. 31st International Symposium on String Processing and Information Retrieval (SPIRE 2024). [DOI] [slides]

  2. [c1]

    Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga: Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. 35th International Workshop on Combinatorial Algorithms (IWOCA 2024). [DOI]

  3. [p1]

    Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga: Packed Acyclic Deterministic Finite Automata. arXiv. [DOI]

  4. [r6]

    柴田 紘希, 天笠 俊之, 塩川 浩昭: 多様性と近接性を考慮した反実仮想説明列挙手法. 第86回 情報処理学会全国大会. [link]

  5. [r5]

    Hiroki Shibata, Dominik Köppl: LZ78 Substring Compression in CDAWG-compressed Space. The 24th Korea-Japan Joint Workshop (WAAC 2024). [link] [slides]

  6. [r4]

    柴田 紘希, クップル ドミニク: CDAWGによるLZ78部分文字列圧縮. 2024年夏のLAシンポジウム. [link] [slides]

  7. [t5]

    トライの接尾辞木に対する高速な更新手法. AFSA 2024年度第2回領域集会. [link] [slides]

  8. [t4]

    Augmented Position Heapの先頭追加オンライン構築. STRセミナー2024. [link] [slides]

2023

  1. [r3]

    柴田 紘希, 石畠 正和: Packed DAWG: packed stringを用いたDAWG上の高速な文字列検索. 第126回 人工知能学会基本問題研究会. [link]

  2. [r2]

    柴田 紘希, 石畠 正和: Position Trie: 高速な動的文字列索引のためのPosition Heapの一般化. 第123回 人工知能学会基本問題研究会. [link]

  3. [t3]

    Packed DAWG: packed stringを用いたDAWG上の高速な文字列検索. AFSA 2023年度第2回領域集会. [link]

  4. [t2]

    Packed DAWG: packed stringを用いたDAWG上の高速な文字列検索. STRセミナー2023. [link]

  5. [t1]

    Position Trie: 高速な動的文字列索引のためのPosition Heapの一般化. フォレストワークショップ2023. [link]

2020

  1. [r1]

    柴田 紘希, 石畠 正和: Augmented Position Heapの先頭追加オンライン構築. 第113回 人工知能学会基本問題研究会. [link]

Awards

Other Activities