Lightweight Parameterized Suffix Array Construction. - Tomohiro I; Satoshi Deguchi; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (IWOCA, 2009)

Counting Parameterized Border Arrays for a Binary Alphabet. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (LATA, 2009)

Verifying a Parameterized Border Array in O(n1.5) Time. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2010)

Counting and Verifying Maximal Palindromes. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2010)

Verifying and enumerating parameterized border arrays. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2011)

General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations. - Tomohiro I; Yuki Enokuma; Hideo Bannai; Masayuki Takeda (ECML/PKDD (2), 2012)

The Position Heap of a Trie. - Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2012)

An efficient algorithm to test square-freeness of strings compressed by straight-line programs. - Hideo Bannai; Travis Gagie; Tomohiro I; Shunsuke Inenaga; Gad M. Landau; Moshe Lewenstein (Inf. Process. Lett., 2012)

Efficient Lyndon Factorization of Grammar Compressed Text. - Tomohiro I; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2013)

From Run Length Encoding to LZ78 and Back Again. - Yuya Tamakoshi; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (DCC, 2013)

Computing Convolution on Grammar-Compressed Text. - Toshiya Tanaka; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (DCC, 2013)

Computing Reversed Lempel-Ziv Factorization Online. - Shiho Sugimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2013)

Palindrome pattern matching. - Tomohiro I; Shunsuke Inenaga; Masayuki Takeda (Theor. Comput. Sci., 2013)

Computing Palindromic Factorizations and Palindromic Covers On-line. - Tomohiro I; Shiho Sugimoto; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2014)

Faster Sparse Suffix Sorting. - Tomohiro I; Juha Kärkkäinen; Dominik Kempa (STACS, 2014)

Faster Compact On-Line Lempel-Ziv Factorization. - Jun-ichi Yamamoto; Tomohiro I; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (STACS, 2014)

Inferring strings from suffix trees and links on a binary alphabet. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Discret. Appl. Math., 2014)

Lempel Ziv Computation in Small Space (LZ-CISS). - Johannes Fischer 001; Tomohiro I; Dominik Köppl (CPM, 2015)

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. - Yoshiaki Matsuoka; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2015)

Arithmetics on Suffix Arrays of Fibonacci Words. - Dominik Köppl; Tomohiro I (WORDS, 2015)

Inferring Strings from Full Abelian Periods. - Makoto Nishida; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2015)

A new characterization of maximal repetitions by Lyndon trees. - Hideo Bannai; Tomohiro I; Shunsuke Inenaga; Yuto Nakashima 001; Masayuki Takeda; Kazuya Tsuruta (SODA, 2015)

Beyond the Runs Theorem. - Johannes Fischer 001; Stepan Holub; Tomohiro I; Moshe Lewenstein (SPIRE, 2015)

A Faster Algorithm for Computing Maximal alpha -gapped Repeats in a String. - Yuka Tanimura; Yuta Fujishige; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2015)

Efficiently Finding All Maximal $α$-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (CoRR, 2015)

Dynamic index, LZ factorization, and LCE queries in compressed space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2015)

Detecting regularities on grammar-compressed strings. - Tomohiro I; Wataru Matsubara; Kouji Shimohira; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Kazuyuki Narisawa; Ayumi Shinohara (Inf. Comput., 2015)

Constructing LZ78 tries and position heaps in linear time for large alphabets. - Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Process. Lett., 2015)

Compressed automata for dictionary matching. - Tomohiro I; Takaaki Nishimoto; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2015)

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. - Yuka Tanimura; Tomohiro I; Hideo Bannai; Shunsuke Inenaga; Simon J. Puglisi; Masayuki Takeda (CPM, 2016)

Online Grammar Compression for Frequent Pattern Discovery. - Shouhei Fukunaga; Yoshimasa Takabatake; Tomohiro I; Hiroshi Sakamoto (ICGI, 2016)

Deterministic Sparse Suffix Sorting on Rewritable Texts. - Johannes Fischer 001; Tomohiro I; Dominik Köppl (LATIN, 2016)

Fully Dynamic Data Structure for LCE Queries in Compressed Space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (MFCS, 2016)

Efficiently Finding All Maximal alpha-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (STACS, 2016)

Closed factorization. - Golnaz Badkobeh; Hideo Bannai; Keisuke Goto 001; Tomohiro I; Costas S. Iliopoulos; Shunsuke Inenaga; Simon J. Puglisi; Shiho Sugimoto (Discret. Appl. Math., 2016)

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. - Tomohiro I; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2016)

Longest Common Extensions with Recompression. - Tomohiro I (CPM, 2017)

A Space-Optimal Grammar Compression. - Yoshimasa Takabatake; Tomohiro I; Hiroshi Sakamoto (ESA, 2017)

A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. - Tatsuya Ohno; Yoshimasa Takabatake; Tomohiro I; Hiroshi Sakamoto (IWOCA, 2017)

The "Runs" Theorem. - Hideo Bannai; Tomohiro I; Shunsuke Inenaga; Yuto Nakashima 001; Masayuki Takeda; Kazuya Tsuruta (SIAM J. Comput., 2017)

Inferring strings from Lyndon factorization. - Yuto Nakashima 001; Takashi Okabe; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2017)

Faster Online Elastic Degenerate String Matching. - Kotaro Aoyama; Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Online LZ77 Parsing and Matching Statistics with RLBWTs. - Hideo Bannai; Travis Gagie; Tomohiro I (CPM, 2018)

Lyndon Factorization of Grammar Compressed Texts Revisited. - Isamu Furuya; Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

The Runs Theorem and Beyond. - Tomohiro I (DLT, 2018)

LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. - Tatsuya Ohno; Keisuke Goto 001; Yoshimasa Takabatake; Tomohiro I; Hiroshi Sakamoto (IWOCA, 2018)

Privacy-Preserving String Edit Distance with Moves. - Shunta Nakagawa; Tokio Sakamoto; Yoshimasa Takabatake; Tomohiro I; Kilho Shin 001; Hiroshi Sakamoto (SISAP, 2018)

Block Palindromes: A New Generalization of Palindromes. - Keisuke Goto 001; Tomohiro I; Hideo Bannai; Shunsuke Inenaga (SPIRE, 2018)

Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. - Johannes Fischer 001; Tomohiro I; Dominik Köppl; Kunihiko Sadakane (Algorithmica, 2018)

Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes. - Tomohiro I; Dominik Köppl (CoRR, 2018)

Approximate Frequent Pattern Discovery in Compressed Space. - Shouhei Fukunaga; Yoshimasa Takabatake; Tomohiro I; Hiroshi Sakamoto (IEICE Trans. Inf. Syst., 2018)

A faster implementation of online RLBWT and its application to LZ77 parsing. - Tatsuya Ohno; Kensuke Sakai; Yoshimasa Takabatake; Tomohiro I; Hiroshi Sakamoto (J. Discrete Algorithms, 2018)

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (Theory Comput. Syst., 2018)

RePair in Compressed Space and Time. - Kensuke Sakai; Tatsuya Ohno; Keisuke Goto 001; Yoshimasa Takabatake; Tomohiro I; Hiroshi Sakamoto (DCC, 2019)

Rpair: Rescaling RePair with Rsync. - Travis Gagie; Tomohiro I; Giovanni Manzini; Gonzalo Navarro 001; Hiroshi Sakamoto; Yoshimasa Takabatake (SPIRE, 2019)

k-Abelian Pattern Matching: Revisited, Corrected, and Extended. - Golnaz Badkobeh; Hideo Bannai; Maxime Crochemore; Tomohiro I; Shunsuke Inenaga; Shiho Sugimoto (Stringology, 2019)

Re-Pair In-Place. - Dominik Köppl; Tomohiro I; Isamu Furuya; Yoshimasa Takabatake; Kensuke Sakai; Keisuke Goto 001 (CoRR, 2019)

Tree-Shape Grammars for Random Access. - Travis Gagie; Tomohiro I; Giovanni Manzini; Gonzalo Navarro 001; Hiroshi Sakamoto; Louisa Seelbach Benkner; Yoshimasa Takabatake (CoRR, 2019)

Improved upper bounds on all maximal α-gapped repeats and palindromes. - Tomohiro I; Dominik Köppl (Theor. Comput. Sci., 2019)

Practical Random Access to SLP-Compressed Texts. - Travis Gagie; Tomohiro I; Giovanni Manzini; Gonzalo Navarro 001; Hiroshi Sakamoto; Louisa Seelbach Benkner; Yoshimasa Takabatake (SPIRE, 2020)

Faster Privacy-Preserving Computation of Edit Distance with Moves. - Yohei Yoshimoto; Masaharu Kataoka; Yoshimasa Takabatake; Tomohiro I; Kilho Shin 001; Hiroshi Sakamoto (WALCOM, 2020)

Dynamic index and LZ factorization in compressed space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Discret. Appl. Math., 2020)

Deterministic Sparse Suffix Sorting in the Restore Model. - Johannes Fischer 001; Tomohiro I; Dominik Köppl (ACM Trans. Algorithms, 2020)

Refining the r-index. - Hideo Bannai; Travis Gagie; Tomohiro I (Theor. Comput. Sci., 2020)

PHONI: Streamed Matching Statistics with Multi-Genome References. - Christina Boucher 001; Travis Gagie; Tomohiro I; Dominik Köppl; Ben Langmead; Giovanni Manzini; Gonzalo Navarro 001; Alejandro Pacheco; Massimiliano Rossi 001 (DCC, 2021)

A Separation of γ and b via Thue-Morse Words. - Hideo Bannai; Mitsuru Funakoshi; Tomohiro I; Dominik Köppl; Takuya Mieno; Takaaki Nishimoto (SPIRE, 2021)

Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. - Tomohiro I; Robert W. Irving; Dominik Köppl; Lorna Love (SPIRE, 2021)

Re-Pair in Small Space. - Dominik Köppl; Tomohiro I; Isamu Furuya; Yoshimasa Takabatake; Kensuke Sakai; Keisuke Goto 001 (Algorithms, 2021)

Load-Balancing Succinct B Trees. - Tomohiro I; Dominik Köppl (CoRR, 2021)

Privacy-Preserving Multiparty Protocol for Feature Selection Problem. - Shinji Ono; Jun Takata; Masaharu Kataoka; Tomohiro I; Kilho Shin 001; Hiroshi Sakamoto (CoRR, 2021)

Converting RLBWT to LZ77 in smaller space. - Masaki Shigekuni; Tomohiro I (DCC, 2022)

Computing Longest (Common) Lyndon Subsequences. - Hideo Bannai; Tomohiro I; Tomasz Kociumaka; Dominik Köppl; Simon J. Puglisi (IWOCA, 2022)

Space-Efficient B Trees via Load-Balancing. - Tomohiro I; Dominik Köppl (IWOCA, 2022)

Substring Complexities on Run-Length Compressed Strings. - Akiyoshi Kawamoto; Tomohiro I (SPIRE, 2022)

Privacy-Preserving Feature Selection with Fully Homomorphic Encryption. - Shinji Ono; Jun Takata; Masaharu Kataoka; Tomohiro I; Kilho Shin 001; Hiroshi Sakamoto (Algorithms, 2022)

Longest (Sub-)Periodic Subsequence. - Hideo Bannai; Tomohiro I; Dominik Köppl (CoRR, 2022)

LCP-dropout: Compression-based Multiple Subword Segmentation for Neural Machine Translation. - Keita Nonaka; Kazutaka Yamanouchi; Tomohiro I; Tsuyoshi Okita 002; Kazutaka Shimada; Hiroshi Sakamoto (CoRR, 2022)

PalFM-Index: FM-Index for Palindrome Pattern Matching. - Shinya Nagashita; Tomohiro I (CPM, 2023)

Longest bordered and periodic subsequences. - Hideo Bannai; Tomohiro I; Dominik Köppl (Inf. Process. Lett., 2023)

On the Hardness of Smallest RLSLPs and Collage Systems. - Akiyoshi Kawamoto; Tomohiro I; Dominik Köppl; Hideo Bannai (DCC, 2024)

Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. - Kento Iseri; Tomohiro I; Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (ICALP, 2024)

Space-Efficient SLP Encoding for O(log N)-Time Random Access. - Akito Takasaka; Tomohiro I (SPIRE, 2024)

Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. - Hideo Bannai; Tomohiro I; Tomasz Kociumaka; Dominik Köppl; Simon J. Puglisi (Algorithmica, 2024)

On the Compressiveness of the Burrows-Wheeler Transform. - Hideo Bannai; Tomohiro I; Yuto Nakashima 001 (CPM, 2025)

Inverting Parameterized Burrows-Wheeler Transform. - Shogen Kawanami; Kento Iseri; Tomohiro I (IWOCA, 2025)

Outsourced Privacy-Preserving Feature Selection Based on Fully Homomorphic Encryption. - Koki Wakiyama; Tomohiro I; Hiroshi Sakamoto (CoRR, 2025)