Kyushu University Academic Staff Educational and Research Activities Database
List of Presentations
Shunsuke Inenaga Last modified date:2019.06.24

Associate Professor / Mathematical Informatics / Department of Informatics / Faculty of Information Science and Electrical Engineering


Presentations
1. Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, O(n log n)-time Text Compression by LZ-style Longest First Substitution, Prague Stringology Conference 2018 (PSC 2018), 2018.08.
2. Prague Stringology Conference 2018 (PSC 2018), Right-to-left Online Construction of Parameterized Position Heaps, Prague Stringology Conference 2018 (PSC 2018), 2018.08.
3. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, The Parameterized Position Heap of a Trie, 11th International Conference on Algorithms and Complexity (CIAC 2019), 2019.05.
4. Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida, MR-RePair
Grammar Compression Based on Maximal Repeats, 2019 Data Compression Conference, DCC 2019, 2019.03, We analyze the grammar generation algorithm of the RePair compression algorithm and show the relation between a grammar generated by RePair and maximal repeats. We reveal that RePair replaces step by step the most frequent pairs within the corresponding most frequent maximal repeats. Then, we design a novel variant of RePair, called MR-RePair, which substitutes the most frequent maximal repeats at once instead of substituting the most frequent pairs consecutively. We implemented MR-RePair and compared the size of the grammar generated by MR-RePair to that by RePair on several text corpora. Our experiments show that MR-RePair generates more compact grammars than RePair does, especially for highly repetitive texts..
5. Keisuke Goto, I. Tomohiro, Hideo Bannai, Shunsuke Inenaga, Block palindromes
A new generalization of palindromes, 25th International Symposium on String Processing and Information Retrieval, SPIRE 2018, 2018.10, We study a new generalization of palindromes and gapped palindromes called block palindromes. A block palindrome is a string that becomes a palindrome when identical substrings are replaced with a distinct character. We investigate several properties of block palindromes and in particular, study substrings of a string which are block palindromes. In so doing, we introduce the notion of a maximal block palindrome, which leads to a compact representation of all block palindromes that occur in a string. We also propose an algorithm which enumerates all maximal block palindromes that appear in a given string T in O(|T|+||MBP(T)||) time, where ||MBP(T)|| is the output size, which is optimal unless all the maximal block palindromes can be represented in a more compact way..
6. Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Recovering, counting and enumerating strings from forward and backward suffix arrays, 25th International Symposium on String Processing and Information Retrieval, SPIRE 2018, 2018.10, The suffix array SAw of a string w of length n is a permutation of [1..n] such that SAw[i]=j iff w[j, n] is the lexicographically i-th suffix of w. In this paper, we consider variants of the reverse-engineering problem on suffix arrays with two given permutations P and Q of [1..n], such that P refers to the forward suffix array of some string w and Q refers to the backward suffix array of the reversed string wR. Our results are the following: (1) An algorithm which computes a solution string over an alphabet of the smallest size, in O(n) time. (2) The exact number of solution strings over an alphabet of size σ. (3) An efficient algorithm which computes all solution strings in the lexicographical order, in time near optimal up to log n factor..
7. Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda, Computing longest common square subsequences, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018, 2018.07, A square is a non-empty string of form Y Y. The longest common square subsequence (LCSqS) problem is to compute a longest square occurring as a subsequence in two given strings A and B. We show that the problem can easily be solved in O(n6) time or O(|M|n4) time with O(n4) space, where n is the length of the strings and M is the set of matching points between A and B. Then, we show that the problem can also be solved in O(σ|M|3 + n) time and O(|M|2 + n) space, or in O(|M|3 log2 n log log n + n) time with O(|M|3 + n) space, where σ is the number of distinct characters occurring in A and B. We also study lower bounds for the LCSqS problem for two or more strings..
8. Kotaro Aoyama, Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster online elastic degenerate string matching, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018, 2018.07, An Elastic-Degenerate String [Iliopoulus et al., LATA 2017] is a sequence of sets of strings, which was recently proposed as a way to model a set of similar sequences. We give an online algorithm for the Elastic-Degenerate String Matching (EDSM) problem that runs in O(nm √mlogm+ N) time and O(m) working space, where n is the number of elastic degenerate segments of the text, N is the total length of all strings in the text, and m is the length of the pattern. This improves the previous algorithm by Grossi et al. [CPM 2017] that runs in O(nm2 + N) time..
9. Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Longest lyndon substring after edit, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018, 2018.07, The longest Lyndon substring of a string T is the longest substring of T which is a Lyndon word. LLS(T) denotes the length of the longest Lyndon substring of a string T. In this paper, we consider computing LLS(T′) where T′ is an edited string formed from T. After O(n) time and space preprocessing, our algorithm returns LLS(T′) in O(log n) time for any single character edit. We also consider a version of the problem with block edits, i.e., a substring of T is replaced by a given string of length l. After O(n) time and space preprocessing, our algorithm returns LLS(T′) in O(l log σ + log n) time for any block edit where σ is the number of distinct characters in T. We can modify our algorithm so as to output all the longest Lyndon substrings of T′ for both problems..
10. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Longest substring palindrome after edit, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018, 2018.07, It is known that the length of the longest substring palindromes (LSPals) of a given string T of length n can be computed in O(n) time by Manacher's algorithm [J. ACM '75]. In this paper, we consider the problem of finding the LSPal after the string is edited. We present an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LSPals in O(log(min{ω, log n})) time after single character substitution, insertion, or deletion, where ω denotes the number of distinct characters appearing in T. We also propose an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LSPals in O(ℓ+log n) time, after an existing substring in T is replaced by a string of arbitrary length ℓ..
11. Isamu Furuya, Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Lyndon factorization of grammar compressed texts revisited, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018, 2018.07, We revisit the problem of computing the Lyndon factorization of a string w of length N which is given as a straight line program (SLP) of size n. For this problem, we show a new algorithm which runs in O(P(n,N) + Q(n,N)n log logN) time and O(n logN + S(n,N)) space where P(n,N), S(n,N), Q(n,N) are respectively the pre-processing time, space, and query time of a data structure for longest common extensions (LCE) on SLPs. Our algorithm improves the algorithm proposed by I et al. (TCS '17), and can be more efficient than the O(N)-time solution by Duval (J. Algorithms '83) when w is highly compressible..
12. Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing abelian string regularities based on RLE, 28th International Workshop on Combinational Algorithms, IWOCA 2017, 2018.01, Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is said to be an Abelian square. If a string w can be factorized into a sequence v1, …, vs of strings such that v1, …, vs-1 are all Abelian equivalent and vs is a substring of a permutation of v1, then w is said to have a regular Abelian period (p, t) where p = |v1| and t = |vs|. If a substring w1[i.i+l-1] of a string w1 and a substring w2[j.j + l - 1] of another string w2 are Abelian equivalent, then the substrings are said to be a common Abelian factor of w1 and w2 and if the length l is the maximum of such then the substrings are said to be a longest common Abelian factor of w1 and w2. We propose efficient algorithms which compute these Abelian regularities using the run length encoding (RLE) of strings. For a given string w of length n whose RLE is of size m, we propose algorithms which compute all Abelian squares occurring in w in O(mn) time, and all regular Abelian periods of w in O(mn) time. For two given strings w1 and w2 of total length n and of total RLE size m, we propose an algorithm which computes all longest common Abelian factors in O(m2n) time..
13. Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Shortest unique palindromic substring queries in optimal time, 28th International Workshop on Combinational Algorithms, IWOCA 2017, 2018.01, palindrome is a string that reads the same forward and backward. A palindromic substring P of a string S is called a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if P occurs exactly once in S, this occurrence of P contains interval [s, t], and every palindromic substring of S which contains interval [s, t] and is shorter than P occurs at least twice in S. The SUPS problem is, given a string S, to preprocess S so that for any subsequent query interval [s, t] all the SUPSs for interval [s, t] can be answered quickly. We present an optimal solution to this problem. Namely, we show how to preprocess a given string S of length n in O(n) time and space so that all SUPSs for any subsequent query interval can be answered in O(α + 1) time, where α is the number of outputs..
14. Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings, 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017.12.
15. Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov and Simon Puglisi, On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation, 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), 2017.09.
16. Tenma Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Order preserving pattern matching on trees and DAGs, 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), 2017.09.
17. Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga and Hiroki Arimura, Linear-size CDAWG: new repetition-aware indexing and grammar compression, 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), 2017.09.
18. Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, On Reverse Engineering the Lyndon Tree, Prague Stringology Conference 2017 (PSC 2017), 2017.08.
19. Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda, Small-space LCE data structure with constant-time queries, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 2017.08.
20. Hideo Bannai, Shunsuke Inenaga, Dominik Köppl, Computing All Distinct Squares in Linear Time for Integer Alphabets, 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017.07.
21. Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster STR-IC-LCS computation via RLE, 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017.07.
22. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tight bounds on the maximum number of shortest unique substrings, 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017.07.
23. Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Abelian string regularities based on RLE, 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), 2017.07.
24. Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Shortest Unique Palindromic Substring Queries in Optimal Time, 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), 2017.07.
25. Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Longest Common Subsequence in at Least k Length Order-isomorphic Substrings, 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017), 2017.01.
26. Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara, Computing longest single-arm-gapped palindromes in a string, 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017), 2017.01.
27. Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Finding gapped palindromes online, 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), 2016.08.
28. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Fully dynamic data structure for LCE queries in compressed space, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016.08.
29. Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016.08.
30. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Dynamic index and LZ factorization in compressed space, Prague Stringology Conference 2016 (PSC 2016), 2016.08.
31. Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Smallest and Largest Repetition Factorizations in O(n log n) time, Prague Stringology Conference 2016 (PSC 2016), 2016.08.
32. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea, Efficiently Finding All Maximal α-gapped Repeats, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016.02.
33. Heikki Hyyrö, Shunsuke Inenaga, Compacting a dynamic edit distance table by RLE compression, 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), 2016.01.
34. Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring Strings from Full Abelian Periods, 26th International Symposium on Algorithms and Computation (ISAAC 2015), 2015.12.
35. Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Waleń, Efficient Algorithms for Longest Closed Factor Array, 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), 2015.09.
36. Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, A faster algorithm for computing maximal α-gapped repeats in a string, 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), 2015.09.
37. Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Left-Right Maximal Generic Words, Proc. Prague Stringology Conference 2015 (PSC 2015), 2015.08.
38. Shunsuke Inenaga, A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications, Proc. Prague Stringology Conference 2015 (PSC 2015), 2015.08.
39. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto, Diverse Palindromic Factorization is NP-Complete, 19th International Conference on Developments in Language Theory (DLT 2015), 2015.07.
40. Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Semi-dynamic compact index for short patterns and succinct van Emde Boas tree, 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), 2015.06.
41. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding, 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), 2015.06.
42. Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Factorizing a string into squares in linear time, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2015.06.
43. Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda, Deterministic sub-linear space LCE data structures with efficient construction, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2015.06.
44. Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Fully-online construction of suffix trees for multiple texts, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2015.06.
45. Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura, Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing, 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), 2015.06.
46. Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, An opportunistic text indexing structure based on run length encoding, 9th International Conference on Algorithms and Complexity (CIAC 2015), 2015.05.
47. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta, A new characterization of maximal repetitions by Lyndon trees, ACM-SIAM Symposium on Discrete Algorithms 2015 (SODA 2015), 2015.01.
48. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto, Closed Factorization, Prague Stringology Conference 2014 (PSC 2014), 2014.09.
49. Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Abelian Covers and Abelian Runs, Prague Stringology Conference 2014 (PSC 2014), 2014.09.
50. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring strings from Lyndon factorization, 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), 2014.08.
51. Tomohiro I, Shiho Sugimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Computing Palindromic Factorizations and Palindromic Covers On-line, 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 2014.06.
52. Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Faster Compact On-Line Lempel-Ziv Factorization, 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014.03.
53. Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Shortest Unique Substrings Queries in Optimal Time, 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2014), 2014.01.
54. Tomohiro I, Yuto Nakashima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text, 20th Symposium on String Processing and Information Retrieval (SPIRE 2013), 2013.10.
55. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara, Detecting Regularities on Grammar-compressed Strings, 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), 2013.08.
56. Shiho Sugimoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Computing Reversed Lempel-Ziv Factorization Online, Prague Stringology Conference 2013 (PSC 2013), 2013.08.
57. Tomohiro I, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Compressed Automata for Dictionary Matching, 18th International Conference on Implementation and Application of Automata (CIAA 2013), 2013.07.
58. Tomohiro I, Yuto Nakashima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Efficient Lyndon factorization of grammar compressed text, 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 2013.06.
59. Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda, Converting SLP to LZ78 in almost linear time, 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 2013.06.
60. Yuya Tamakoshi, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, From Run Length Encoding to LZ78 and Back Again, Data Compression Conference 2013 (DCC 2013), 2013.03.
61. Toshiya Tanaka, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Computing convolution on grammar-compressed text, Data Compression Conference 2013 (DCC 2013), 2013.03.
62. Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, Permuted Pattern Matching on Multi-Track Strings, 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013), 2013.01.
63. Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Efficient LZ78 Factorization of Grammar Compressed Text, 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), 2012.10.
64. Yuto Nakashima, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, The Position Heap of a Trie, 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), 2012.10.
65. Yuto Nakashima, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, The Position Heap of a Trie, 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), 2012.10.
66. Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Speeding-up q-gram mining on grammar-based compressed texts, 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012), 2012.07.
67. Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts, 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), 2012.01.
68. Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Fast q-gram Mining on SLP Compressed Strings, 18th Symposium on String Processing and Information Retrieval (SPIRE 2011), 2011.10.
69. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring Strings from Suffix Trees and Links on a Binary Alphabet, The Prague Stringology Conference 2011 (PSC 2011), 2011.08.
70. Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Longest Common Substring/Subsequence of Non-linear Texts, The Prague Stringology Conference 2011 (PSC 2011), 2011.08.
71. Tomohiro I, Shunsuke Inenaga, Masayuki Takeda, Palindrome Pattern Matching, 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011.06.
72. Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts, 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011.06.
73. Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura, An Anonymous Authentication Protocol with Single-database PIR, Australasian Information Security Conference 2011 (AISC 2011), 2011.01.
74. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Counting and Verifying Maximal Palindromes, 17th Symposium on String Processing and Information Retrieval (SPIRE 2010), 2010.10.
75. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Verifying a Parameterized Border Array in O(n^{1.5}) Time, 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), 2010.06.