I Tomohiro

发表

Approximate Frequent Pattern Discovery in Compressed Space

Hiroshi Sakamoto, Yoshimasa Takabatake, Shouhei Fukunaga, 2018, IEICE Trans. Inf. Syst..

A Faster Implementation of Online Run-Length Burrows-Wheeler Transform

Hiroshi Sakamoto, Yoshimasa Takabatake, I Tomohiro, 2017, IWOCA.

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, CPM.

LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression

Hiroshi Sakamoto, Yoshimasa Takabatake, I Tomohiro, 2018, IWOCA.

Online Grammar Compression for Frequent Pattern Discovery pdf

Hiroshi Sakamoto, Yoshimasa Takabatake, Shouhei Fukunaga, 2016, ICGI.

Improved algorithms for longest common extension in sublinear space

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016 .

A faster implementation of online RLBWT and its application to LZ77 parsing

Hiroshi Sakamoto, Yoshimasa Takabatake, I Tomohiro, 2018, J. Discrete Algorithms.

Palindrome Pattern Matching

Shunsuke Inenaga, Masayuki Takeda, I Tomohiro, 2011, CPM.

Inferring strings from Lyndon factorization

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, Theor. Comput. Sci..

Longest Common Extensions with Recompression

I Tomohiro, I. Tomohiro, 2016, CPM.

Computing Palindromic Factorizations and Palindromic Covers On-line

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2014, CPM.

Inferring strings from suffix trees and links on a binary alphabet

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, Discret. Appl. Math..

An efficient algorithm to test square-freeness of strings compressed by straight-line programs

Gad M. Landau, Moshe Lewenstein, Hideo Bannai, 2012, Inf. Process. Lett..

Deterministic Sparse Suffix Sorting on Rewritable Texts

Johannes Fischer, I Tomohiro, Dominik Köppl, 2016, LATIN.

Detecting regularities on grammar-compressed strings

Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, 2015, Inf. Comput..

Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, SPIRE.

Palindrome pattern matching

Shunsuke Inenaga, Masayuki Takeda, I Tomohiro, 2013, Theor. Comput. Sci..

Compressed automata for dictionary matching

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, Theor. Comput. Sci..

Verifying and enumerating parameterized border arrays

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, Theor. Comput. Sci..

Counting and Verifying Maximal Palindromes

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2010, SPIRE.

Dynamic Index and LZ Factorization in Compressed Space pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, Stringology.

Lyndon Factorization of Grammar Compressed Texts Revisited

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, CPM.

Faster Sparse Suffix Sorting

Juha Kärkkäinen, I Tomohiro, Dominik Kempa, 2014, STACS.

Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees

Kunihiko Sadakane, Johannes Fischer, I Tomohiro, 2017, Algorithmica.

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, Theor. Comput. Sci..

Computing palindromic factorizations and palindromic covers on-line

Shunsuke Inenaga, Masayuki Takeda, I Tomohiro, 2014 .

Online LZ77 Parsing and Matching Statistics with RLBWTs pdf

Hideo Bannai, Travis Gagie, I Tomohiro, 2018, CPM.

The Position Heap of a Trie

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2012, SPIRE.

The Runs Theorem and Beyond

I Tomohiro, 2018, DLT.

Lightweight Parameterized Suffix Array Construction

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2009, IWOCA.

Block Palindromes: A New Generalization of Palindromes pdf

Hideo Bannai, Shunsuke Inenaga, I Tomohiro, 2018, SPIRE.

Efficient Lyndon factorization of grammar compressed text

Shunsuke Inenaga, Masayuki Takeda, I Tomohiro, 2012 .

Arithmetics on Suffix Arrays of Fibonacci Words

I Tomohiro, Dominik Köppl, 2015, WORDS.

A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, SPIRE.

Inferring Strings from Full Abelian Periods

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, ISAAC.

RePair in Compressed Space and Time

Hiroshi Sakamoto, Yoshimasa Takabatake, I Tomohiro, 2019, 2019 Data Compression Conference (DCC).

Deterministic Sparse Suffix Sorting in the Restore Model

I Tomohiro, Dominik Köppl, Johannes Fischer, 2020, ACM Trans. Algorithms.

Counting Parameterized Border Arrays for a Binary Alphabet

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2009, LATA.

Fully Dynamic Data Structure for LCE Queries in Compressed Space pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, MFCS.

A Space-Optimal Grammar Compression

Hiroshi Sakamoto, Yoshimasa Takabatake, I Tomohiro, 2017, ESA.

Compressed Automata for Dictionary Matching

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, CIAA.

Constructing LZ78 tries and position heaps in linear time for large alphabets pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, Inf. Process. Lett..

Deterministic sub-linear space LCE data structures with efficient construction

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, CPM.

Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes pdf

I Tomohiro, Dominik Köppl, 2019, Theor. Comput. Sci..

The "Runs" Theorem

Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, 2014, SIAM J. Comput..

Faster Online Elastic Degenerate String Matching

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, CPM.

Dynamic index, LZ factorization, and LCE queries in compressed space pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, ArXiv.

General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations

Hideo Bannai, Masayuki Takeda, I Tomohiro, 2012, ECML/PKDD.

Lempel Ziv Computation in Small Space (LZ-CISS)

Johannes Fischer, I Tomohiro, Dominik Köppl, 2015, CPM.

Faster Compact On-Line Lempel-Ziv Factorization

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2014, STACS.

A new characterization of maximal repetitions by Lyndon trees pdf

Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, 2015, SODA.

From Run Length Encoding to LZ78 and Back Again

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, 2013 Data Compression Conference.

Efficiently Finding All Maximal alpha-gapped Repeats

Shunsuke Inenaga, Florin Manea, Pawel Gawrychowski, 2016, STACS.

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes

Shunsuke Inenaga, Florin Manea, Pawel Gawrychowski, 2017, Theory of Computing Systems.

Efficient Lyndon Factorization of Grammar Compressed Text pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, CPM.

Verifying a Parameterized Border Array in O(n1.5) Time

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2010, CPM.

Detecting Regularities on Grammar-Compressed Strings pdf

Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, 2013, MFCS.

Closed Factorization

Costas S. Iliopoulos, Hideo Bannai, Shunsuke Inenaga, 2014, Stringology.

Computing Convolution on Grammar-Compressed Text

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, 2013 Data Compression Conference.

Efficiently Finding All Maximal $α$-gapped Repeats pdf

Shunsuke Inenaga, Florin Manea, Pawel Gawrychowski, 2015, ArXiv.

Computing Reversed Lempel-Ziv Factorization Online

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, Stringology.

Inferring Strings from Lyndon Factorization

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2014, MFCS.

Privacy-Preserving String Edit Distance with Moves

Hiroshi Sakamoto, Yoshimasa Takabatake, Kilho Shin, 2018, SISAP.

Information Processing on Compressed Data

Hiroshi Sakamoto, Yoshimasa Takabatake, I Tomohiro, 2021, Sublinear Computation Paradigm.

Computing Longest (Common) Lyndon Subsequences pdf

Hideo Bannai, Simon J. Puglisi, I Tomohiro, 2022, ArXiv.

A Separation of $\gamma$ and $b$ via Thue--Morse Words

Hideo Bannai, I Tomohiro, Mitsuru Funakoshi, 2021, 2104.09985.

Load-Balancing Succinct B Trees pdf

I Tomohiro, Dominik Köppl, 2021, ArXiv.

Privacy-Preserving Multiparty Protocol for Feature Selection Problem pdf

Hiroshi Sakamoto, Kilho Shin, I Tomohiro, 2021, ArXiv.

Re-Pair in Small Space

Yoshimasa Takabatake, I Tomohiro, Isamu Furuya, 2021, Algorithms.

Verifying a Parameterized Border Array in O ( n 1 . 5 )

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2010 .