Tomohiro I
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
55
Venues
15
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
55 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | R-Enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies. | Kotaro Kimura, Tomohiro I |
| 2026 | CPM | On the Smallest Size of Internal Collage Systems. | Soichiro Migita, Kyotaro Uehata, Tomohiro I |
| 2025 | CPM | On the Compressiveness of the Burrows-Wheeler Transform. | Hideo Bannai, Tomohiro I, Yuto Nakashima |
| 2025 | IWOCA | Inverting Parameterized Burrows-Wheeler Transform. | Shogen Kawanami, Kento Iseri, Tomohiro I |
| 2024 | DCC | On the Hardness of Smallest RLSLPs and Collage Systems. | Akiyoshi Kawamoto, Tomohiro I, Dominik Kppl, Hideo Bannai |
| 2024 | ICALP | Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. | Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | SPIRE | Space-Efficient SLP Encoding for O(log N)-Time Random Access. | Akito Takasaka, Tomohiro I |
| 2023 | CPM | PalFM-Index: FM-Index for Palindrome Pattern Matching. | Shinya Nagashita, Tomohiro I |
| 2022 | DCC | Converting RLBWT to LZ77 in smaller space. | Masaki Shigekuni, Tomohiro I |
| 2022 | IWOCA | Computing Longest (Common) Lyndon Subsequences. | Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Kppl, Simon J. Puglisi |
| 2022 | IWOCA | Space-Efficient B Trees via Load-Balancing. | Tomohiro I, Dominik Kppl |
| 2022 | SPIRE | Substring Complexities on Run-Length Compressed Strings. | Akiyoshi Kawamoto, Tomohiro I |
| 2021 | DCC | PHONI: Streamed Matching Statistics with Multi-Genome References. | Christina Boucher, Travis Gagie, Tomohiro I, Dominik Kppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi |
| 2021 | SPIRE | A Separation of γ and b via Thue-Morse Words. | Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Kppl, Takuya Mieno, Takaaki Nishimoto |
| 2021 | SPIRE | Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. | Tomohiro I, Robert W. Irving, Dominik Kppl, Lorna Love |
| 2020 | DCC | Re-Pair in Small Space. | Dominik Kppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto |
| 2020 | SPIRE | Practical Random Access to SLP-Compressed Texts. | Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake |
| 2020 | WALCOM | Faster Privacy-Preserving Computation of Edit Distance with Moves. | Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto |
| 2019 | DCC | RePair in Compressed Space and Time. | Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2019 | SPIRE | Rpair: Rescaling RePair with Rsync. | Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake |
| 2018 | CPM | Faster Online Elastic Degenerate String Matching. | Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Online LZ77 Parsing and Matching Statistics with RLBWTs. | Hideo Bannai, Travis Gagie, Tomohiro I |
| 2018 | CPM | Lyndon Factorization of Grammar Compressed Texts Revisited. | Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | DLT | The Runs Theorem and Beyond. | Tomohiro I |
| 2018 | IWOCA | LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. | Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2018 | SISAP | Privacy-Preserving String Edit Distance with Moves. | Shunta Nakagawa, Tokio Sakamoto, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto |
| 2018 | SPIRE | Block Palindromes: A New Generalization of Palindromes. | Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga |
| 2017 | CPM | Longest Common Extensions with Recompression. | Tomohiro I |
| 2017 | ESA | A Space-Optimal Grammar Compression. | Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2017 | IWOCA | A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. | Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2016 | CPM | Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. | Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda |
| 2016 | LATIN | Deterministic Sparse Suffix Sorting on Rewritable Texts. | Johannes Fischer, Tomohiro I, Dominik Kppl |
| 2016 | MFCS | Fully Dynamic Data Structure for LCE Queries in Compressed Space. | Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | STACS | Efficiently Finding All Maximal alpha-gapped Repeats. | Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Kppl, Florin Manea |
| 2015 | CPM | Lempel Ziv Computation in Small Space (LZ-CISS). | Johannes Fischer, Tomohiro I, Dominik Kppl |
| 2015 | CPM | Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. | Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | ISAAC | Inferring Strings from Full Abelian Periods. | Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | SODA | A new characterization of maximal repetitions by Lyndon trees. | Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta |
| 2015 | SPIRE | Beyond the Runs Theorem. | Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein |
| 2015 | SPIRE | A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. | Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | CPM | Computing Palindromic Factorizations and Palindromic Covers On-line. | Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | MFCS | Inferring Strings from Lyndon Factorization. | Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | STACS | Faster Sparse Suffix Sorting. | Tomohiro I, Juha Krkkinen, Dominik Kempa |
| 2014 | STACS | Faster Compact On-Line Lempel-Ziv Factorization. | Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2013 | CPM | Efficient Lyndon Factorization of Grammar Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | DCC | From Run Length Encoding to LZ78 and Back Again. | Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | DCC | Computing Convolution on Grammar-Compressed Text. | Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | MFCS | Detecting Regularities on Grammar-Compressed Strings. | Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara |
| 2013 | SPIRE | Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2012 | SPIRE | The Position Heap of a Trie. | Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2011 | CPM | Palindrome Pattern Matching. | Tomohiro I, Shunsuke Inenaga, Masayuki Takeda |
| 2010 | CPM | Verifying a Parameterized Border Array in | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2010 | SPIRE | Counting and Verifying Maximal Palindromes. | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2009 | IWOCA | Lightweight Parameterized Suffix Array Construction. | Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2009 | LATA | Counting Parameterized Border Arrays for a Binary Alphabet. | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |