6 citations · 11 across the 3 of their papers we have counts for
3 papers
cs.DS2016★ 5 cited
Longest Common Extensions with Recompression
Tomohiro I
Given two positions and in a string of length , a longest common extension (LCE) query asks for the length of the longest common prefix between suffixes beginning at…
cs.DS2016★ 6 cited
Online Grammar Compression for Frequent Pattern Discovery
Shouhei Fukunaga, Yoshimasa Takabatake, I Tomohiro +1
Various grammar compression algorithms have been proposed in the last decade. A grammar compression is a restricted CFG deriving the string deterministically. An efficient grammar…
cs.DS2015
Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga +2
We present the first worst-case linear-time algorithm to compute the Lempel-Ziv 78 factorization of a given string over an integer alphabet. Our algorithm is based on nearest marke…