Profile
Affiliation
Research Interests
- String Algorithms
- Data Compression
- Compressed Data Structure
Education
- 2024.4 - Joint Graduate School of Mathematics for Innovation, Kyushu University
- 2022.4 - 2024.3 College of Information Science, School of Informatics, University of Tsukuba
- 2017.4 - 2022.3 Department of Computer Engineering, National Institute of Technology, Tokyo College
Publications
Preprints
- Hiroki Shibata, Hideo Bannai. String Representation in Suffixient Set Size Space [arXiv]
- 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]
- Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai. Counting Distinct (Non-)Crossing Substrings in Optimal Time [arXiv]
Journal Articles
- 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, No.7 [paper, arXiv]
- Hiroki Shibata, Dominik Koppl. LZ78 Substring Compression in Compressed Space, Theory of Computing Systems, Vol.70, No.1 [paper, arXiv]
Conference Papers
- 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), [proceeding, arXiv]
- 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) [proceeding, arXiv]
- Haruki Umezaki, Hiroki Shibata, Dominik Koppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai. Counting distinct (non-)crossing substrings, 32nd International Symposium on String Processing and Information Retrieval (SPIRE 2025) [proceeding, arXiv]
- Alan Cleary, Joseph Winjum, Jordan Dood, Hiroki Shibata, Shunsuke Inenaga. Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access, 23rd Symposium on Experimental Algorithm (SEA 2025) [proceeding, slides]
- 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) [proceeding, arXiv, slides]
- Hiroki Shibata, Dominik Koppl. LZ78 Substring Compression with CDAWGs, 31st International Symposium on String Processing and Information Retrieval (SPIRE 2024) [proceeding, slides]
- 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) [proceeding, arXiv]
Other Presentations
- Online computation of Maximal Closed Substrings. Sequences in London 2026 [link, slides]
- 5th place solution: Compressed Code Golf Techniques. The 2025 Google Code Golf Championship (NeurIPS 2025 Competition Track) [link, slides]
- 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]
- Hiroki Shibata, Dominik Koppl. LZ78 Substring Compression in CDAWG-compressed Space. The 24th Korea-Japan Joint Workshop (WAAC 2024) [link, slides]
Links