- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j3 |      | Tomohiro I, Shunsuke Inenaga, Masayuki Takeda: Palindrome pattern matching. Theor. Comput. Sci. 483: 162-170 (2013) |
| c9 | | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Lyndon Factorization of Grammar Compressed Text. CPM 2013: 153-164 |
| i3 | | Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Computing convolution on grammar-compressed text. CoRR abs/1303.3945 (2013) |
| i2 | | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Lyndon factorization of grammar compressed text. CoRR abs/1304.7061 (2013) |
| i1 | | 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) |
| 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 | | |
| c5 | | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Inferring Strings from Suffix Trees and Links on a Binary Alphabet. Stringology 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 |
| 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page