default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomohiro I
Person information
- affiliation: Frontier Research Academy for Young Researchers, Kyushu Institute of Technology, Japan
SPARQL queries 
🛈 Please note that only 70% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2020 – today
- 2026
[j25]Akito Takasaka, Tomohiro I:
Space-Efficient SLP Encoding for O(log N)-Time Random Access. Theory Comput. Syst. 70(2): 28 (2026)- [c65]Kotaro Kimura, Tomohiro I:
R-Enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies. CPM 2026: 10:1-10:14 - [c64]Soichiro Migita, Kyotaro Uehata, Tomohiro I:
On the Smallest Size of Internal Collage Systems. CPM 2026: 31:1-31:14 - [i41]Eitatsu Tomita, Tomohiro I:
Another Way to Lower the Bound for Distinct Squares. CoRR abs/2602.12711 (2026) - 2025
- [j24]Tomohiro I
, Dominik Köppl, Hiroshi Sakamoto, Sohei Yamaguchi:
Space-Efficient B Trees via Load-Balancing. Theory Comput. Syst. 69(3): 32 (2025) - [c63]Hideo Bannai, Tomohiro I, Yuto Nakashima:
On the Compressiveness of the Burrows-Wheeler Transform. CPM 2025: 17:1-17:15 - [c62]Shogen Kawanami, Kento Iseri, Tomohiro I:
Inverting Parameterized Burrows-Wheeler Transform. IWOCA 2025: 217-227 - [i40]Shogen Kawanami, Kento Iseri, Tomohiro I:
Inverting Parameterized Burrows-Wheeler Transform. CoRR abs/2503.06970 (2025) - [i39]Koki Wakiyama, Tomohiro I, Hiroshi Sakamoto:
Outsourced Privacy-Preserving Feature Selection Based on Fully Homomorphic Encryption. CoRR abs/2505.12869 (2025) - [i38]Soichiro Migita, Kyotaro Uehata, Tomohiro I:
On the Smallest Size of Internal Collage Systems. CoRR abs/2509.11602 (2025) - [i37]Kotaro Kimura, Tomohiro I:
R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies. CoRR abs/2511.11057 (2025) - 2024
- [j23]Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86(3): 735-756 (2024) - [c61]Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai:
On the Hardness of Smallest RLSLPs and Collage Systems. DCC 2024: 243-252 - [c60]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: 89:1-89:19 - [c59]Akito Takasaka, Tomohiro I:
Space-Efficient SLP Encoding for O(log N)-Time Random Access. SPIRE 2024: 336-347 - [i36]Akito Takasaka, Tomohiro I:
Space-efficient SLP Encoding for O(log N)-time Random Access. CoRR abs/2406.15011 (2024) - [i35]Hideo Bannai, Tomohiro I, Yuto Nakashima:
On the compressiveness of the Burrows-Wheeler transform. CoRR abs/2411.11298 (2024) - 2023
- [j22]Hideo Bannai, Tomohiro I, Dominik Köppl:
Longest bordered and periodic subsequences. Inf. Process. Lett. 182: 106398 (2023) - [c58]Shinya Nagashita, Tomohiro I:
PalFM-Index: FM-Index for Palindrome Pattern Matching. CPM 2023: 23:1-23:15 - [i34]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 abs/2308.05977 (2023) - 2022
- [j21]Shinji Ono, Jun Takata, Masaharu Kataoka, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Privacy-Preserving Feature Selection with Fully Homomorphic Encryption. Algorithms 15(7): 229 (2022) - [c57]Masaki Shigekuni, Tomohiro I:
Converting RLBWT to LZ77 in smaller space. DCC 2022: 242-251 - [c56]Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest (Common) Lyndon Subsequences. IWOCA 2022: 128-142 - [c55]Tomohiro I, Dominik Köppl:
Space-Efficient B Trees via Load-Balancing. IWOCA 2022: 327-340 - [c54]Akiyoshi Kawamoto, Tomohiro I:
Substring Complexities on Run-Length Compressed Strings. SPIRE 2022: 132-143 - [i33]Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest (Common) Lyndon Subsequences. CoRR abs/2201.06773 (2022) - [i32]Hideo Bannai, Tomohiro I, Dominik Köppl:
Longest (Sub-)Periodic Subsequence. CoRR abs/2202.07189 (2022) - [i31]Keita Nonaka, Kazutaka Yamanouchi, Tomohiro I, Tsuyoshi Okita, Kazutaka Shimada, Hiroshi Sakamoto:
LCP-dropout: Compression-based Multiple Subword Segmentation for Neural Machine Translation. CoRR abs/2202.13590 (2022) - [i30]Akiyoshi Kawamoto, Tomohiro I:
Substring Complexities on Run-length Compressed Strings. CoRR abs/2205.12421 (2022) - [i29]Shinya Nagashita, Tomohiro I:
PalFM-index: FM-index for Palindrome Pattern Matching. CoRR abs/2206.12600 (2022) - 2021
- [j20]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair in Small Space. Algorithms 14(1): 5 (2021) - [c53]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: 193-202 - [c52]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: 143-150 - [c51]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. SPIRE 2021: 167-178 - [i28]Tomohiro I, Dominik Köppl:
Load-Balancing Succinct B Trees. CoRR abs/2104.08751 (2021) - [i27]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. CoRR abs/2104.09985 (2021) - [i26]Shinji Ono, Jun Takata, Masaharu Kataoka, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Privacy-Preserving Multiparty Protocol for Feature Selection Problem. CoRR abs/2110.05088 (2021) - 2020
- [j19]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274: 116-129 (2020) - [j18]Johannes Fischer, Tomohiro I, Dominik Köppl:
Deterministic Sparse Suffix Sorting in the Restore Model. ACM Trans. Algorithms 16(4): 50:1-50:53 (2020) - [j17]Hideo Bannai, Travis Gagie, Tomohiro I:
Refining the r-index. Theor. Comput. Sci. 812: 96-108 (2020) - [c50]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair in Small Space. DCC 2020: 377 - [c49]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake:
Practical Random Access to SLP-Compressed Texts. SPIRE 2020: 221-231 - [c48]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair in Small Space. PSC 2020: 134-147 - [c47]Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Faster Privacy-Preserving Computation of Edit Distance with Moves. WALCOM 2020: 308-320 - [i25]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 abs/2011.05610 (2020)
2010 – 2019
- 2019
- [j16]Tomohiro I, Dominik Köppl:
Improved upper bounds on all maximal α-gapped repeats and palindromes. Theor. Comput. Sci. 753: 1-15 (2019) - [c46]Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
RePair in Compressed Space and Time. DCC 2019: 518-527 - [c45]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake:
Rpair: Rescaling RePair with Rsync. SPIRE 2019: 35-44 - [c44]Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto:
k-Abelian Pattern Matching: Revisited, Corrected, and Extended. PSC 2019: 29-40 - [i24]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake:
Rpair: Rescaling RePair with Rsync. CoRR abs/1906.00809 (2019) - [i23]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair In-Place. CoRR abs/1908.04933 (2019) - [i22]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake:
Tree-Shape Grammars for Random Access. CoRR abs/1910.07145 (2019) - [i21]Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Faster Privacy-Preserving Computation of Edit Distance with Moves. CoRR abs/1911.10719 (2019) - 2018
- [j15]Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane:
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica 80(7): 2048-2081 (2018) - [j14]Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
Approximate Frequent Pattern Discovery in Compressed Space. IEICE Trans. Inf. Syst. 101-D(3): 593-601 (2018) - [j13]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 52-53: 18-28 (2018) - [j12]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): 162-191 (2018) - [c43]Hideo Bannai, Travis Gagie, Tomohiro I:
Online LZ77 Parsing and Matching Statistics with RLBWTs. CPM 2018: 7:1-7:12 - [c42]Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Online Elastic Degenerate String Matching. CPM 2018: 9:1-9:10 - [c41]Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Lyndon Factorization of Grammar Compressed Texts Revisited. CPM 2018: 24:1-24:10 - [c40]Tomohiro I:
The Runs Theorem and Beyond. DLT 2018: 18-23 - [c39]Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. IWOCA 2018: 323-335 - [c38]Shunta Nakagawa, Tokio Sakamoto, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Privacy-Preserving String Edit Distance with Moves. SISAP 2018: 226-240 - [c37]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. SPIRE 2018: 183-190 - [i20]Hideo Bannai, Travis Gagie, Tomohiro I:
Online LZ77 Parsing and Matching Statistics with RLBWTs. CoRR abs/1802.05906 (2018) - [i19]Tomohiro I, Dominik Köppl:
Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes. CoRR abs/1802.10355 (2018) - [i18]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. CoRR abs/1806.00198 (2018) - [i17]Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
RePair in Compressed Space and Time. CoRR abs/1811.01472 (2018) - 2017
- [j11]Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
The "Runs" Theorem. SIAM J. Comput. 46(5): 1501-1514 (2017) - [j10]Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from Lyndon factorization. Theor. Comput. Sci. 689: 147-156 (2017) - [c36]Tomohiro I:
Longest Common Extensions with Recompression. CPM 2017: 18:1-18:15 - [c35]Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Space-Optimal Grammar Compression. ESA 2017: 67:1-67:15 - [c34]Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. IWOCA 2017: 409-419 - [i16]Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. CoRR abs/1704.05233 (2017) - 2016
- [j9]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed factorization. Discret. Appl. Math. 212: 23-29 (2016) - [j8]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theor. Comput. Sci. 656: 215-224 (2016) - [c33]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: 1:1-1:10 - [c32]Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
Online Grammar Compression for Frequent Pattern Discovery. ICGI 2016: 93-104 - [c31]Johannes Fischer, Tomohiro I, Dominik Köppl:
Deterministic Sparse Suffix Sorting on Rewritable Texts. LATIN 2016: 483-496 - [c30]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Fully Dynamic Data Structure for LCE Queries in Compressed Space. MFCS 2016: 72:1-72:15 - [c29]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal alpha-gapped Repeats. STACS 2016: 39:1-39:14 - [c28]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Index and LZ Factorization in Compressed Space. PSC 2016: 158-170 - [i15]Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda:
Deterministic sub-linear space LCE data structures with efficient construction. CoRR abs/1601.07670 (2016) - [i14]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Fully dynamic data structure for LCE queries in compressed space. CoRR abs/1605.01488 (2016) - [i13]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index and LZ factorization in compressed space. CoRR abs/1605.09558 (2016) - [i12]Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
Online Grammar Compression for Frequent Pattern Discovery. CoRR abs/1607.04446 (2016) - [i11]Tomohiro I:
Longest Common Extensions with Recompression. CoRR abs/1611.05359 (2016) - 2015
- [j7]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: 74-89 (2015) - [j6]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): 655-659 (2015) - [j5]Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed automata for dictionary matching. Theor. Comput. Sci. 578: 30-41 (2015) - [c27]Johannes Fischer, Tomohiro I, Dominik Köppl:
Lempel Ziv Computation in Small Space (LZ-CISS). CPM 2015: 172-184 - [c26]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: 355-366 - [c25]Dominik Köppl, Tomohiro I:
Arithmetics on Suffix Arrays of Fibonacci Words. WORDS 2015: 135-146 - [c24]Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Full Abelian Periods. ISAAC 2015: 768-779 - [c23]Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
A new characterization of maximal repetitions by Lyndon trees. SODA 2015: 562-571 - [c22]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: 124-136 - [c21]Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein:
Beyond the Runs Theorem. SPIRE 2015: 277-286 - [i10]Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets. CoRR abs/1501.06619 (2015) - [i9]Johannes Fischer, Tomohiro I, Dominik Köppl:
Lempel Ziv Computation In Small Space (LZ-CISS). CoRR abs/1504.02605 (2015) - [i8]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index, LZ factorization, and LCE queries in compressed space. CoRR abs/1504.06954 (2015) - [i7]Johannes Fischer, Tomohiro I, Dominik Köppl:
Deterministic Sparse Suffix Sorting on Rewritable Texts. CoRR abs/1509.07417 (2015) - [i6]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal $α$-gapped Repeats. CoRR abs/1509.09237 (2015) - 2014
- [j4]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from suffix trees and links on a binary alphabet. Discret. Appl. Math. 163: 316-325 (2014) - [c20]Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Factorizations and Palindromic Covers On-line. CPM 2014: 150-161 - [c19]Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Lyndon Factorization. MFCS (2) 2014: 565-576 - [c18]Tomohiro I, Juha Kärkkäinen, Dominik Kempa:
Faster Sparse Suffix Sorting. STACS 2014: 386-396 - [c17]Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. STACS 2014: 675-686 - [c16]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed Factorization. PSC 2014: 162-168 - [i5]Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
A new characterization of maximal repetitions by Lyndon trees. CoRR abs/1406.0263 (2014) - 2013
- [j3]Tomohiro I, Shunsuke Inenaga, Masayuki Takeda:
Palindrome pattern matching. Theor. Comput. Sci. 483: 162-170 (2013) - [c15]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon Factorization of Grammar Compressed Text. CPM 2013: 153-164 - [c14]Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
From Run Length Encoding to LZ78 and Back Again. DCC 2013: 143-152 - [c13]Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Convolution on Grammar-Compressed Text. DCC 2013: 451-460 - [c12]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting Regularities on Grammar-Compressed Strings. MFCS 2013: 571-582 - [c11]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. SPIRE 2013: 174-185 - [c10]Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Reversed Lempel-Ziv Factorization Online. PSC 2013: 107-118 - [c9]Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Automata for Dictionary Matching. CIAA 2013: 319-330 - [i4]Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing convolution on grammar-compressed text. CoRR abs/1303.3945 (2013) - [i3]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon factorization of grammar compressed text. CoRR abs/1304.7061 (2013) - [i2]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting regularities on grammar-compressed strings. CoRR abs/1304.7067 (2013) - [i1]Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. CoRR abs/1305.6095 (2013) - 2012
- [j2]Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein:
An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. 112(19): 711-714 (2012) - [c8]Tomohiro I, Yuki Enokuma, Hideo Bannai, Masayuki Takeda:
General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations. ECML/PKDD (2) 2012: 435-450 - [c7]Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Position Heap of a Trie. SPIRE 2012: 360-371 - 2011
- [j1]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50): 6959-6981 (2011) - [c6]Tomohiro I, Shunsuke Inenaga, Masayuki Takeda:
Palindrome Pattern Matching. CPM 2011: 232-245 - [c5]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Suffix Trees and Links on a Binary Alphabet. PSC 2011: 121-130 - 2010
- [c4]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying a Parameterized Border Array in O(n1.5) Time. CPM 2010: 238-250 - [c3]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting and Verifying Maximal Palindromes. SPIRE 2010: 135-146
2000 – 2009
- 2009
- [c2]Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Lightweight Parameterized Suffix Array Construction. IWOCA 2009: 312-323 - [c1]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting Parameterized Border Arrays for a Binary Alphabet. LATA 2009: 422-433
Coauthor Index
[c63] [j23] [c61] [i35] [j22] [c56] [i33] [i32] [c51] [i27] [j19] [j17] [c44] [c43] [c42] [c41] [c37] [i20] [i18] [j11] [j10] [j9] [j8] [c33] [c30] [c28] [i15] [i14] [i13] [j7] [j6] [j5] [c26] [c24] [c23] [c22] [i10] [i8] [j4] [c20] [c19] [c17] [c16] [i5] [c15] [c14] [c13] [c12] [c11] [c10] [c9] [i4] [i3] [i2] [i1] [j2] [c8] [c7] [j1] [c5] [c4] [c3] [c2] [c1]
[j19] [c44] [j12] [c42] [c41] [c37] [i18] [j11] [j10] [j9] [j8] [c33] [c30] [c29] [c28] [i15] [i14] [i13] [j7] [j6] [j5] [c26] [c24] [c23] [c22] [i10] [i8] [i6] [j4] [c20] [c19] [c17] [c16] [i5] [j3] [c15] [c14] [c13] [c12] [c11] [c10] [c9] [i4] [i3] [i2] [i1] [j2] [c7] [j1] [c6] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-27 07:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
