Tomohiro I

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 74

Top Venues

Publications

Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai
On the Hardness of Smallest RLSLPs and Collage Systems. DCC (2024)
Akito Takasaka, Tomohiro I
Space-efficient SLP Encoding for O(log N)-time Random Access. CoRR (2024)
Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. ICALP (2024)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86 (3) (2024)
Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. CoRR (2023)
Hideo Bannai, Tomohiro I, Dominik Köppl
Longest bordered and periodic subsequences. Inf. Process. Lett. 182 (2023)
Shinya Nagashita, Tomohiro I
PalFM-Index: FM-Index for Palindrome Pattern Matching. CPM (2023)
Tomohiro I, Dominik Köppl
Space-Efficient B Trees via Load-Balancing. IWOCA (2022)
Shinji Ono, Jun Takata, Masaharu Kataoka, Tomohiro I, Kilho Shin, Hiroshi Sakamoto
Privacy-Preserving Feature Selection with Fully Homomorphic Encryption. Algorithms 15 (7) (2022)
Shinya Nagashita, Tomohiro I
PalFM-index: FM-index for Palindrome Pattern Matching. CoRR (2022)
Masaki Shigekuni, Tomohiro I
Converting RLBWT to LZ77 in smaller space. DCC (2022)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest (Common) Lyndon Subsequences. CoRR (2022)
Hideo Bannai, Tomohiro I, Dominik Köppl
Longest (Sub-)Periodic Subsequence. CoRR (2022)
Akiyoshi Kawamoto, Tomohiro I
Substring Complexities on Run-length Compressed Strings. CoRR (2022)
Akiyoshi Kawamoto, Tomohiro I
Substring Complexities on Run-Length Compressed Strings. SPIRE (2022)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest (Common) Lyndon Subsequences. IWOCA (2022)
Keita Nonaka, Kazutaka Yamanouchi, Tomohiro I, Tsuyoshi Okita, Kazutaka Shimada, Hiroshi Sakamoto
LCP-dropout: Compression-based Multiple Subword Segmentation for Neural Machine Translation. CoRR (2022)
Tomohiro I, Robert W. Irving, Dominik Köppl, Lorna Love
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. SPIRE (2021)
Shinji Ono, Jun Takata, Masaharu Kataoka, Tomohiro I, Kilho Shin, Hiroshi Sakamoto
Privacy-Preserving Multiparty Protocol for Feature Selection Problem. CoRR (2021)
Tomohiro I, Dominik Köppl
Load-Balancing Succinct B Trees. CoRR (2021)
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
A Separation of γ and b via Thue-Morse Words. SPIRE (2021)
Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi
PHONI: Streamed Matching Statistics with Multi-Genome References. DCC (2021)
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Re-Pair in Small Space. Algorithms 14 (1) (2021)
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
A Separation of γ and b via Thue-Morse Words. CoRR (2021)
Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake
Practical Random Access to SLP-Compressed Texts. SPIRE (2020)
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Re-Pair in Small Space. DCC (2020)
Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi
PHONI: Streamed Matching Statistics with Multi-Genome References. CoRR (2020)
Hideo Bannai, Travis Gagie, Tomohiro I
-index. Theor. Comput. Sci. 812 (2020)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274 (2020)
Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto
Faster Privacy-Preserving Computation of Edit Distance with Moves. WALCOM (2020)
Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting in the Restore Model. ACM Trans. Algorithms 16 (4) (2020)
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Re-Pair in Small Space. Stringology (2020)
Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake
Tree-Shape Grammars for Random Access. CoRR (2019)
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Re-Pair In-Place. CoRR (2019)
Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto
Faster Privacy-Preserving Computation of Edit Distance with Moves. CoRR (2019)
Tomohiro I, Dominik Köppl
-gapped repeats and palindromes. Theor. Comput. Sci. 753 (2019)
Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake
Rpair: Rescaling RePair with Rsync. SPIRE (2019)
Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto
-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology (2019)
Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
RePair in Compressed Space and Time. DCC (2019)
Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake
Rpair: Rescaling RePair with Rsync. CoRR (2019)
Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
RePair in Compressed Space and Time. CoRR (2018)
Tomohiro I, Dominik Köppl
Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes. CoRR (2018)
Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
Block Palindromes: A New Generalization of Palindromes. SPIRE (2018)
Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Online Elastic Degenerate String Matching. CPM (2018)
Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
Approximate Frequent Pattern Discovery in Compressed Space. IEICE Trans. Inf. Syst. (3) (2018)
Shunta Nakagawa, Tokio Sakamoto, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto
Privacy-Preserving String Edit Distance with Moves. SISAP (2018)
Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. IWOCA (2018)
Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Lyndon Factorization of Grammar Compressed Texts Revisited. CPM (2018)
Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea
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. Theory Comput. Syst. 62 (1) (2018)
Hideo Bannai, Travis Gagie, Tomohiro I
Online LZ77 Parsing and Matching Statistics with RLBWTs. CoRR (2018)
Tatsuya Ohno, Kensuke Sakai, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
A faster implementation of online RLBWT and its application to LZ77 parsing. J. Discrete Algorithms (2018)
Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
Block Palindromes: A New Generalization of Palindromes. CoRR (2018)
Hideo Bannai, Travis Gagie, Tomohiro I
Online LZ77 Parsing and Matching Statistics with RLBWTs. CPM (2018)
Tomohiro I
The Runs Theorem and Beyond. DLT (2018)
Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica 80 (7) (2018)
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
The "Runs" Theorem. SIAM J. Comput. 46 (5) (2017)
Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
A Space-Optimal Grammar Compression. ESA (2017)
Tomohiro I
Longest Common Extensions with Recompression. CPM (2017)
Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. CoRR (2017)
Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. IWOCA (2017)
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Inferring strings from Lyndon factorization. Theor. Comput. Sci. 689 (2017)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic index and LZ factorization in compressed space. CoRR (2016)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Fully dynamic data structure for LCE queries in compressed space. CoRR (2016)
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
Closed factorization. Discret. Appl. Math. 212 (2016)
Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
Online Grammar Compression for Frequent Pattern Discovery. CoRR (2016)
Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting on Rewritable Texts. LATIN (2016)
Tomohiro I
Longest Common Extensions with Recompression. CoRR (2016)
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
Deterministic sub-linear space LCE data structures with efficient construction. CoRR (2016)
Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea
Efficiently Finding All Maximal alpha-gapped Repeats. STACS (2016)
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theor. Comput. Sci. 656 (2016)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Fully Dynamic Data Structure for LCE Queries in Compressed Space. MFCS (2016)
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. CPM (2016)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic Index and LZ Factorization in Compressed Space. Stringology (2016)
Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
Online Grammar Compression for Frequent Pattern Discovery. ICGI (2016)
Johannes Fischer, Tomohiro I, Dominik Köppl
Lempel Ziv Computation in Small Space (LZ-CISS). CPM (2015)
Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein
Beyond the Runs Theorem. SPIRE (2015)
Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. SPIRE (2015)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic index, LZ factorization, and LCE queries in compressed space. CoRR (2015)
Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea
Efficiently Finding All Maximal $α$-gapped Repeats. CoRR (2015)
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets. CoRR (2015)
Johannes Fischer, Tomohiro I, Dominik Köppl
Lempel Ziv Computation In Small Space (LZ-CISS). CoRR (2015)
Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting on Rewritable Texts. CoRR (2015)
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
Detecting regularities on grammar-compressed strings. Inf. Comput. 240 (2015)
Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compressed automata for dictionary matching. Theor. Comput. Sci. 578 (2015)
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
A new characterization of maximal repetitions by Lyndon trees. SODA (2015)
Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. CPM (2015)
Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Inferring Strings from Full Abelian Periods. ISAAC (2015)
Dominik Köppl, Tomohiro I
Arithmetics on Suffix Arrays of Fibonacci Words. WORDS (2015)
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Constructing LZ78 tries and position heaps in linear time for large alphabets. Inf. Process. Lett. 115 (9) (2015)
Tomohiro I, Juha Kärkkäinen, Dominik Kempa
Faster Sparse Suffix Sorting. STACS (2014)
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
A new characterization of maximal repetitions by Lyndon trees. CoRR (2014)
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
Closed Factorization. Stringology (2014)
Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
Faster Compact On-Line Lempel-Ziv Factorization. STACS (2014)
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Inferring Strings from Lyndon Factorization. MFCS (2) (2014)
Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Palindromic Factorizations and Palindromic Covers On-line. CPM (2014)
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Inferring strings from suffix trees and links on a binary alphabet. Discret. Appl. Math. 163 (2014)
Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
Faster Compact On-Line Lempel-Ziv Factorization CoRR (2013)
Tomohiro I, Shunsuke Inenaga, Masayuki Takeda
Palindrome pattern matching. Theor. Comput. Sci. 483 (2013)
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. SPIRE (2013)
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
Detecting Regularities on Grammar-Compressed Strings. MFCS (2013)

Tomohiro I.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tomohiro I