2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2015★ 1 cited
Lempel Ziv Computation In Small Space (LZ-CISS)
Johannes Fischer, Tomohiro I, Dominik Köppl
For both the Lempel Ziv 77- and 78-factorization we propose algorithms generating the respective factorization using bits (for any positive constant …
cs.DS2013★ 2 cited
Detecting regularities on grammar-compressed strings
Tomohiro I, Wataru Matsubara, Kouji Shimohira +5
We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). Given an SLP of size that represents a s…
cs.DS2013
Efficient Lyndon factorization of grammar compressed text
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga +2
We present an algorithm for computing the Lyndon factorization of a string that is given in grammar compressed form, namely, a Straight Line Program (SLP). The algorithm runs in $O…