Shunsuke Inenaga

350 papers A* 1A 2B 75C 61Misc 26Journal 176Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Faster and simpler online computation of string net frequency. Inf. Process. Lett. Shunsuke Inenaga
2026	J	`jnl`	Online Computation of Palindromes and Suffix Trees on Tries. CoRR Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno, Masakazu Ishihata, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2026	J	`jnl`	Sensitivity of Repetitiveness Measures to String Reversal. CoRR Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina
2026	J	`jnl`	Subsequence Matching and LCS under Cartesian-Tree Equivalence. Theory Comput. Syst. Taketo Tsujimoto, Yuki Yonemoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2025	J	`jnl`	Bit Catastrophes for the Burrows-Wheeler Transform. Theory Comput. Syst. Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina
2025	B	`conf`	Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access. SEA Alan M. Cleary, Joseph Winjum, Jordan Dood, Hiroki Shibata, Shunsuke Inenaga
2025	J	`jnl`	Computing maximal palindromes in non-standard matching models. Inf. Comput. Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2025	J	`jnl`	Constant sensitivity on the CDAWGs. CoRR Rikuya Hamai, Hiroto Fujimaru, Shunsuke Inenaga
2025	C	`conf`	Counting Distinct (Non-)crossing Substrings. SPIRE Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2025	J	`jnl`	Counting distinct (non-)crossing substrings. CoRR Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2025	J	`jnl`	LZSE: an LZ-style compressor supporting O(log n)-time random access. CoRR Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga
2025	C	`conf`	Nyldon Factorization of Thue-Morse Words and Fibonacci Words. SPIRE Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2025	J	`jnl`	Nyldon Factorization of Thue-Morse Words and Fibonacci Words. CoRR Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2025	C	`conf`	On the Number of MUSs Crossing a Position. SPIRE Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga
2025	J	`jnl`	On the number of MUSs crossing a position. CoRR Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga
2025	J	`jnl`	On the sensitivity of CDAWG-grammars. CoRR Hiroto Fujimaru, Shunsuke Inenaga
2025	—	`conf`	Packed Acyclic Deterministic Finite Automata. SOFSEM (2) Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga
2025	B	`conf`	Space-Efficient Online Computation of String Net Occurrences. CPM Takuya Mieno, Shunsuke Inenaga
2025	—	`conf`	Subsequence Matching and LCS with Segment Number Constraints. CIAC (2) Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2025	C	`conf`	Tight Additive Sensitivity on LZ-Style Compressors and String Attractors. SPIRE Yuto Fujie, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga
2025	J	`jnl`	Tight Additive Sensitivity on LZ-style Compressors and String Attractors. CoRR Yuto Fujie, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga
2025	J	`jnl`	Tight bounds for the sensitivity of CDAWGs with left-end edits. Acta Informatica Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
2024	B	`ed.`	35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka, Japan, June 25-27, 2024 CPM Shunsuke Inenaga, Simon J. Puglisi
2024	C	`conf`	All-Pairs Suffix-Prefix on Dynamic Set of Strings. SPIRE Masaru Kikuchi, Shunsuke Inenaga
2024	J	`jnl`	All-Pairs Suffix-Prefix on Dynamic Set of Strings. CoRR Masaru Kikuchi, Shunsuke Inenaga
2024	J	`jnl`	Bit catastrophes for the Burrows-Wheeler Transform. CoRR Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina
2024	C	`conf`	Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. IWOCA Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2024	J	`jnl`	Computing Longest Common Subsequence under Cartesian-Tree Matching Model. CoRR Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2024	C	`conf`	Computing Maximal Palindromes in Non-standard Matching Models. IWOCA Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2024	C	`conf`	Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
2024	J	`jnl`	Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
2024	B	`conf`	Edit and Alphabet-Ordering Sensitivity of Lex-Parse. MFCS Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
2024	J	`jnl`	Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
2024	J	`jnl`	Faster and Simpler Online Computation of String Net Frequency. CoRR Shunsuke Inenaga
2024	C	`conf`	Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. SPIRE Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga
2024	J	`jnl`	Faster and simpler online/sliding rightmost Lempel-Ziv factorizations. CoRR Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga
2024	J	`jnl`	Faster space-efficient STR-IC-LCS computation. Theor. Comput. Sci. Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2024	J	`jnl`	Linear time online algorithms for constructing linear-size suffix trie. Theor. Comput. Sci. Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi
2024	J	`jnl`	Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved. CoRR Shunsuke Inenaga
2024	J	`jnl`	Linear-size suffix tries and linear-size CDAWGs simplified and improved. Acta Informatica Shunsuke Inenaga
2024	C	`conf`	On the Number of Non-equivalent Parameterized Squares in a String. SPIRE Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2024	J	`jnl`	On the Number of Non-equivalent Parameterized Squares in a String. CoRR Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2024	J	`jnl`	Packed Acyclic Deterministic Finite Automata. CoRR Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga
2024	J	`jnl`	Relating Left and Right Extensions of Maximal Repeats. CoRR Shunsuke Inenaga, Dmitry Kosolobov
2024	C	`conf`	Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. SPIRE Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga
2024	J	`jnl`	Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. CoRR Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga
2024	C	`conf`	Simple Linear-Time Repetition Factorization. SPIRE Yuki Yonemoto, Shunsuke Inenaga
2024	J	`jnl`	Simple Linear-time Repetition Factorization. CoRR Yuki Yonemoto, Shunsuke Inenaga
2024	J	`jnl`	Space-Efficient Online Computation of String Net Occurrences. CoRR Takuya Mieno, Shunsuke Inenaga
2024	J	`jnl`	Subsequence Pattern Matching with Segment Number Constraint. CoRR Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2024	J	`jnl`	The CDAWG Index and Pattern Matching on Grammar-Compressed Strings. CoRR Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga
2023	C	`conf`	Bit Catastrophes for the Burrows-Wheeler Transform. DLT Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina
2023	Misc	`conf`	Computing SEQ-IC-LCS of Labeled Graphs. PSC Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga
2023	J	`jnl`	Computing SEQ-IC-LCS of Labeled Graphs. CoRR Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga
2023	C	`conf`	Largest Repetition Factorization of Fibonacci Words. SPIRE Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga
2023	J	`jnl`	Linear Time Online Algorithms for Constructing Linear-size Suffix Trie. CoRR Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi
2023	C	`conf`	Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2023	J	`jnl`	Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets. CoRR Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2023	J	`jnl`	Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theor. Comput. Sci. Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2023	J	`jnl`	Linear-time computation of generalized minimal absent words for multiple strings. CoRR Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2023	—	`conf`	On Sensitivity of Compact Directed Acyclic Word Graphs. WORDS Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
2023	J	`jnl`	On Sensitivity of Compact Directed Acyclic Word Graphs. CoRR Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
2023	C	`conf`	Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
2023	J	`jnl`	Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
2023	J	`jnl`	Sensitivity of string compressors and repetitiveness measures. Inf. Comput. Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga
2023	J	`jnl`	Sliding suffix trees simplified. CoRR Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2023	B	`conf`	Space-Efficient STR-IC-LCS Computation. SOFSEM Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2022	J	`jnl`	A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. Algorithmica Yoshifumi Sakai, Shunsuke Inenaga
2022	B	`conf`	Cartesian Tree Subsequence Matching. CPM Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
2022	J	`jnl`	Cartesian Tree Subsequence Matching. CoRR Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
2022	J	`jnl`	Combinatorics of minimal absent words for a sliding window. Theor. Comput. Sci. Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022	J	`jnl`	Computing Minimal Unique Substrings for a Sliding Window. Algorithmica Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022	B	`conf`	Computing Palindromes on a Trie in Linear Time. ISAAC Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
2022	J	`jnl`	Computing maximal generalized palindromes. CoRR Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022	J	`jnl`	Computing palindromes on a trie in linear time. CoRR Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
2022	J	`jnl`	Factorizing Strings into Repetitions. Theory Comput. Syst. Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022	B	`conf`	Minimal Absent Words on Run-Length Encoded Strings. CPM Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2022	J	`jnl`	Minimal Absent Words on Run-Length Encoded Strings. CoRR Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2022	C	`conf`	Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. SPIRE Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2022	J	`jnl`	Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. CoRR Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2022	J	`jnl`	Palindromic trees for a sliding window and its applications. Inf. Process. Lett. Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022	J	`jnl`	Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. Theor. Comput. Sci. Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2022	J	`jnl`	RePair Grammars are the Smallest Grammars for Fibonacci Words. CoRR Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
2022	J	`jnl`	Space-Efficient STR-IC-LCS Computation. CoRR Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2022	J	`jnl`	c-trie++: A dynamic trie tailored for fast prefix searches. Inf. Comput. Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022	B	`conf`	{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
2021	J	`jnl`	Combinatorics of minimal absent words for a sliding window. CoRR Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	J	`jnl`	Compressed Communication Complexity of Hamming Distance. Algorithms Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	J	`jnl`	Compressed Communication Complexity of Hamming Distance. CoRR Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	J	`jnl`	Computing longest palindromic substring after single-character or block-wise edits. Theor. Comput. Sci. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	Misc	`conf`	Counting Lyndon Subsequences. PSC Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021	J	`jnl`	Counting Lyndon Subsequences. CoRR Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021	J	`jnl`	Efficiently computing runs on a trie. Theor. Comput. Sci. Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	J	`jnl`	Grammar Index By Induced Suffix Sorting. CoRR Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	C	`conf`	Grammar Index by Induced Suffix Sorting. SPIRE Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	C	`conf`	Longest Common Rollercoasters. SPIRE Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	J	`jnl`	Longest previous overlapping factor array. Inf. Process. Lett. Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar
2021	B	`conf`	Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello
2021	C	`conf`	On the Approximation Ratio of LZ-End to LZ77. SPIRE Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021	J	`jnl`	On the approximation ratio of LZ-End to LZ77. CoRR Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021	C	`conf`	Position Heaps for Cartesian-Tree Matching on Strings and Tries. SPIRE Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
2021	J	`jnl`	Position Heaps for Cartesian-tree Matching on Strings and Tries. CoRR Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
2021	J	`jnl`	Sensitivity of string compressors and repetitiveness measures. CoRR Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga
2021	C	`conf`	The Parameterized Suffix Tray. CIAC Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	J	`jnl`	The Smallest Grammar Problem Revisited. IEEE Trans. Inf. Theory Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
2021	J	`jnl`	Towards a Complete Perspective on Labeled Tree Indexing: New Size Bounds, Efficient Constructions, and Beyond. J. Inf. Process. Shunsuke Inenaga
2020	B	`conf`	A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. ISAAC Yoshifumi Sakai, Shunsuke Inenaga
2020	J	`jnl`	A reduction of the dynamic time warping distance to the longest increasing subsequence length. CoRR Yoshifumi Sakai, Shunsuke Inenaga
2020	J	`jnl`	Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	B	`conf`	DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. CPM Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020	J	`jnl`	DAWGs for parameterized matching: online construction and related indexing structures. CoRR Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020	B	`conf`	Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020	J	`jnl`	Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020	J	`jnl`	Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	J	`jnl`	Efficient computation of longest single-arm-gapped palindromes in a string. Theor. Comput. Sci. Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
2020	J	`jnl`	Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. Theory Comput. Syst. Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	B	`conf`	Faster STR-EC-LCS Computation. SOFSEM Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	J	`jnl`	Faster STR-EC-LCS Computation. CoRR Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	J	`jnl`	Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian
2020	J	`jnl`	Grammar-compressed Self-index with Lyndon Words. CoRR Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	C	`conf`	Longest Square Subsequence Problem Revisited. SPIRE Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
2020	J	`jnl`	Longest Square Subsequence Problem Revisited. CoRR Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
2020	B	`conf`	Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. SOFSEM Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	J	`jnl`	Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello
2020	C	`conf`	On Repetitiveness Measures of Thue-Morse Words. SPIRE Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	J	`jnl`	On repetitiveness measures of Thue-Morse words. CoRR Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	Misc	`conf`	Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. PSC Shunsuke Inenaga
2020	J	`jnl`	Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. CoRR Shunsuke Inenaga
2020	J	`jnl`	Practical Grammar Compression Based on Maximal Repeats. Algorithms Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
2020	J	`jnl`	Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	B	`conf`	Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. LATIN Shunsuke Inenaga
2020	J	`jnl`	The Parameterized Suffix Tray. CoRR Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	C	`conf`	Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	J	`jnl`	Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020	B	`conf`	c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	B	`conf`	An Improved Data Structure for Left-Right Maximal Generic Words Problem. ISAAC Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	C	`conf`	Compact Data Structures for Shortest Unique Substring Queries. SPIRE Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	Compact Data Structures for Shortest Unique Substring Queries. CoRR Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	Misc	`conf`	Computing Maximal Palindromes and Distinct Palindromes in a Trie. PSC Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	B	`conf`	Computing Runs on a Trie. CPM Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	Computing runs on a trie. CoRR Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	C	`conf`	Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. SPIRE Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. CoRR Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	Dynamic Packed Compact Tries Revisited. CoRR Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	Efficient dynamic dictionary matching with DAWGs and AC-automata. Theor. Comput. Sci. Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2019	B	`conf`	Faster Queries for Longest Substring Palindrome After Block Edit. CPM Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	Faster queries for longest substring palindrome after block edit. CoRR Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	B	`conf`	MR-RePair: Grammar Compression Based on Maximal Repeats. DCC Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
2019	J	`jnl`	Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. CoRR Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	C	`conf`	On Longest Common Property Preserved Substring Queries. SPIRE Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019	J	`jnl`	On Longest Common Property Preserved Substring Queries. CoRR Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019	B	`conf`	On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. CPM Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	On the size of the smallest alphabet for Lyndon trees. Theor. Comput. Sci. Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	B	`conf`	Online Algorithms for Constructing Linear-Size Suffix Trie. CPM Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga
2019	J	`jnl`	Online Algorithms for Constructing Linear-size Suffix Trie. CoRR Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga
2019	C	`conf`	Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. IWOCA Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. CoRR Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. CoRR Shunsuke Inenaga
2019	C	`conf`	The Parameterized Position Heap of a Trie. CIAC Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	The Parameterized Position Heap of a Trie. CoRR Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	J	`jnl`	The smallest grammar problem revisited. CoRR Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
2018	J	`jnl`	A hardness result and new algorithm for the longest common palindromic subsequence problem. Inf. Process. Lett. Shunsuke Inenaga, Heikki Hyyrö
2018	J	`jnl`	Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	C	`conf`	Block Palindromes: A New Generalization of Palindromes. SPIRE Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
2018	J	`jnl`	Block Palindromes: A New Generalization of Palindromes. CoRR Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
2018	B	`conf`	Computing longest common square subsequences. CPM Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda
2018	J	`jnl`	Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto
2018	J	`jnl`	Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions. Int. J. Found. Comput. Sci. Heikki Hyyrö, Shunsuke Inenaga
2018	B	`conf`	Faster Online Elastic Degenerate String Matching. CPM Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	B	`conf`	Longest Lyndon Substring After Edit. CPM Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	B	`conf`	Longest substring palindrome after edit. CPM Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	B	`conf`	Lyndon Factorization of Grammar Compressed Texts Revisited. CPM Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	J	`jnl`	MR-RePair: Grammar Compression based on Maximal Repeats. CoRR Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
2018	Misc	`conf`	O(n log n)-time Text Compression by LZ-style Longest First Substitution. PSC Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	J	`jnl`	O(n log n)-time text compression by LZ-style longest first substitution. CoRR Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	C	`conf`	Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. SPIRE Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	Misc	`conf`	Right-to-left Online Construction of Parameterized Position Heaps. PSC Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	J	`jnl`	Right-to-left online construction of parameterized position heaps. CoRR Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	J	`jnl`	Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. Theory Comput. Syst. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea
2017	B	`conf`	Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. ISAAC Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	C	`conf`	Computing Abelian String Regularities Based on RLE. IWOCA Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	J	`jnl`	Computing Abelian regularities on RLE strings. CoRR Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	B	`conf`	Computing All Distinct Squares in Linear Time for Integer Alphabets. CPM Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
2017	B	`conf`	Computing Longest Single-arm-gapped Palindromes in a String. SOFSEM Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
2017	J	`jnl`	Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Algorithmica Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	J	`jnl`	Efficient Dynamic Dictionary Matching with DAWGs and AC-automata. CoRR Diptarama, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2017	B	`conf`	Faster STR-IC-LCS Computation via RLE. CPM Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	J	`jnl`	Faster STR-IC-LCS computation via RLE. CoRR Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	J	`jnl`	Inferring strings from Lyndon factorization. Theor. Comput. Sci. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	C	`conf`	Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. SPIRE Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura
2017	J	`jnl`	Linear-size CDAWG: new repetition-aware indexing and grammar compression. CoRR Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura
2017	B	`conf`	Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. SOFSEM Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara
2017	Misc	`conf`	On Reverse Engineering the Lyndon Tree. PSC Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	C	`conf`	On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. SPIRE Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi
2017	J	`jnl`	On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. CoRR Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi
2017	C	`conf`	Order Preserving Pattern Matching on Trees and DAGs. SPIRE Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	J	`jnl`	Order preserving pattern matching on trees and DAGs. CoRR Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	J	`jnl`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2017	C	`conf`	Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	B	`conf`	Small-Space LCE Data Structure with Constant-Time Queries. MFCS Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2017	J	`jnl`	Small-space encoding LCE data structure with constant-time queries. CoRR Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2017	J	`jnl`	The "Runs" Theorem. SIAM J. Comput. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2017	B	`conf`	Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	J	`jnl`	A hardness result and new algorithm for the longest common palindromic subsequence problem. CoRR Shunsuke Inenaga, Heikki Hyyrö
2016	J	`jnl`	Closed factorization. Discret. Appl. Math. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
2016	B	`conf`	Compacting a Dynamic Edit Distance Table by RLE Compression. SOFSEM Heikki Hyyrö, Shunsuke Inenaga
2016	J	`jnl`	Computing All Distinct Squares in Linear Time for Integer Alphabets. CoRR Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
2016	B	`conf`	Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. MFCS Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	Misc	`conf`	Computing Smallest and Largest Repetition Factorizations in PSC Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	J	`jnl`	Computing longest single-arm-gapped palindromes in a string. CoRR Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
2016	B	`conf`	Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. CPM Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
2016	J	`jnl`	Deterministic sub-linear space LCE data structures with efficient construction. CoRR Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
2016	Misc	`conf`	Dynamic Index and LZ Factorization in Compressed Space. PSC Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	J	`jnl`	Dynamic index and LZ factorization in compressed space. CoRR Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	A	`conf`	Efficiently Finding All Maximal alpha-gapped Repeats. STACS Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea
2016	B	`conf`	Factorizing a String into Squares in Linear Time. CPM Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea
2016	J	`jnl`	Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theor. Comput. Sci. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	C	`conf`	Finding Gapped Palindromes Online. IWOCA Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	B	`conf`	Fully Dynamic Data Structure for LCE Queries in Compressed Space. MFCS Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	J	`jnl`	Fully dynamic data structure for LCE queries in compressed space. CoRR Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	B	`conf`	Fully-online Construction of Suffix Trees for Multiple Texts. CPM Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura
2016	J	`jnl`	Generalized pattern matching and periodicity under substring consistent equivalence relations. Theor. Comput. Sci. Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	J	`jnl`	Longest Common Subsequence in at Least k Length Order-isomorphic Substrings. CoRR Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara
2016	C	`conf`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2016	J	`jnl`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2016	B	`conf`	Shortest Unique Substring Queries on Run-Length Encoded Strings. MFCS Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	J	`jnl`	Shortest unique palindromic substring queries in optimal time. CoRR Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016	C	`ed.`	String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings SPIRE Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai
2016	J	`jnl`	Tight bound on the maximum number of shortest unique substrings. CoRR Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	C	`conf`	A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. SPIRE Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	Misc	`conf`	A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications. PSC Shunsuke Inenaga
2015	A*	`conf`	A new characterization of maximal repetitions by Lyndon trees. SODA Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2015	C	`conf`	An Opportunistic Text Indexing Structure Based on Run Length Encoding. CIAC Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	J	`jnl`	Compressed automata for dictionary matching. Theor. Comput. Sci. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	Misc	`conf`	Computing Left-Right Maximal Generic Words. PSC Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	J	`jnl`	Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets. CoRR Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	J	`jnl`	Constructing LZ78 tries and position heaps in linear time for large alphabets. Inf. Process. Lett. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	J	`jnl`	Detecting regularities on grammar-compressed strings. Inf. Comput. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2015	C	`conf`	Diverse Palindromic Factorization Is NP-complete. DLT Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
2015	J	`jnl`	Diverse Palindromic Factorization is NP-Complete. CoRR Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
2015	J	`jnl`	Dynamic edit distance table under a general weighted cost function. J. Discrete Algorithms Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga
2015	J	`jnl`	Dynamic index, LZ factorization, and LCE queries in compressed space. CoRR Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	C	`conf`	Efficient Algorithms for Longest Closed Factor Array. SPIRE Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen
2015	J	`jnl`	Efficiently Finding All Maximal $α$-gapped Repeats. CoRR Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea
2015	J	`jnl`	Fully-online construction of suffix trees and DAWGs for multiple texts. CoRR Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura
2015	B	`conf`	Inferring Strings from Full Abelian Periods. ISAAC Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015	B	`conf`	LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. CPM Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2015	B	`conf`	Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. CPM Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014	J	`jnl`	A new characterization of maximal repetitions by Lyndon trees. CoRR Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2014	Misc	`conf`	Closed Factorization. PSC Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
2014	Misc	`conf`	Computing Abelian Covers and Abelian Runs. PSC Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014	B	`conf`	Computing Palindromic Factorizations and Palindromic Covers On-line. CPM Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014	A	`conf`	Faster Compact On-Line Lempel-Ziv Factorization. STACS Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2014	—	`conf`	Inferring Strings from Lyndon Factorization. MFCS (2) Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014	J	`jnl`	Inferring strings from suffix trees and links on a binary alphabet. Discret. Appl. Math. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014	B	`conf`	Shortest Unique Substrings Queries in Optimal Time. SOFSEM Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	C	`conf`	Compressed Automata for Dictionary Matching. CIAA Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	B	`conf`	Computing Convolution on Grammar-Compressed Text. DCC Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	Misc	`conf`	Computing Reversed Lempel-Ziv Factorization Online. PSC Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	J	`jnl`	Computing convolution on grammar-compressed text CoRR Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	B	`conf`	Converting SLP to LZ78 in almost Linear Time. CPM Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda
2013	B	`conf`	Detecting Regularities on Grammar-Compressed Strings. MFCS Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013	J	`jnl`	Detecting regularities on grammar-compressed strings CoRR Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013	B	`conf`	Efficient Lyndon Factorization of Grammar Compressed Text. CPM Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	J	`jnl`	Efficient Lyndon factorization of grammar compressed text CoRR Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	J	`jnl`	Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2013	J	`jnl`	Faster Compact On-Line Lempel-Ziv Factorization CoRR Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2013	C	`conf`	Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. SPIRE Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	J	`jnl`	Foreword. Int. J. Comput. Math. Shunsuke Inenaga, Carlos Martín-Vide
2013	B	`conf`	From Run Length Encoding to LZ78 and Back Again. DCC Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013	J	`jnl`	Palindrome pattern matching. Theor. Comput. Sci. Tomohiro I, Shunsuke Inenaga, Masayuki Takeda
2013	B	`conf`	Permuted Pattern Matching on Multi-track Strings. SOFSEM Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga
2012	J	`jnl`	An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein
2012	B	`conf`	Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012	C	`conf`	Efficient LZ78 Factorization of Grammar Compressed Text. SPIRE Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012	J	`jnl`	Efficient LZ78 factorization of grammar compressed text CoRR Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012	J	`jnl`	Finding Characteristic Substrings from Compressed Texts. Int. J. Found. Comput. Sci. Shunsuke Inenaga, Hideo Bannai
2012	B	`conf`	Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. CPM Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012	J	`jnl`	Speeding-up $q$-gram mining on grammar-based compressed texts CoRR Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012	C	`conf`	The Position Heap of a Trie. SPIRE Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2012	J	`jnl`	Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding CoRR Jun-ichi Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011	Misc	`conf`	An Anonymous Authentication Protocol with Single-database PIR. AISC Toru Nakamura, Shunsuke Inenaga, Kensuke Baba, Daisuke Ikeda, Hiroto Yasuura
2011	Misc	`conf`	Computing Longest Common Substring/Subsequence of Non-linear Texts. PSC Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2011	J	`jnl`	Computing q-gram Frequencies on Collage Systems CoRR Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011	J	`jnl`	Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts CoRR Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011	J	`jnl`	Fast $q$-gram Mining on SLP Compressed Strings CoRR Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011	C	`conf`	Fast q-gram Mining on SLP Compressed Strings. SPIRE Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011	B	`conf`	Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. CPM Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011	Misc	`conf`	Inferring Strings from Suffix Trees and Links on a Binary Alphabet. PSC Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2011	C	`ed.`	Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings LATA Adrian-Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide
2011	J	`jnl`	Missing pattern discovery. J. Discrete Algorithms Stanislav Angelov, Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen
2011	B	`conf`	Palindrome Pattern Matching. CPM Tomohiro I, Shunsuke Inenaga, Masayuki Takeda
2011	J	`jnl`	Password Based Anonymous Authentication with Private Information Retrieval. J. Digit. Inf. Manag. Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura
2011	J	`jnl`	Restructuring Compressed Texts without Explicit Decompression CoRR Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda
2011	J	`jnl`	Towards Modeling Stored-value Electronic Money Systems. Inf. Media Technol. Shunsuke Inenaga, Kenichirou Oyama, Hiroto Yasuura
2011	J	`jnl`	Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2010	J	`jnl`	An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. Chic. J. Theor. Comput. Sci. Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
2010	—	`conf`	An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services. ICCSA (4) Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura
2010	C	`conf`	Counting and Verifying Maximal Palindromes. SPIRE Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2010	B	`conf`	Dynamic Edit Distance Table under a General Weighted Cost Function. SOFSEM Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga
2010	B	`conf`	Verifying a Parameterized Border Array in CPM Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2009	C	`conf`	Counting Parameterized Border Arrays for a Binary Alphabet. LATA Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2009	J	`jnl`	Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
2009	Misc	`conf`	Finding Characteristic Substrings from Compressed Texts. PSC Shunsuke Inenaga, Hideo Bannai
2009	C	`conf`	Lightweight Parameterized Suffix Array Construction. IWOCA Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2009	J	`jnl`	Linear-Time Text Compression by Longest-First Substitution. Algorithms Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
2009	Misc	`conf`	Modeling Costs of Access Control with Various Key Management Systems. PDPTA Tomomi Yamasaki, Shunsuke Inenaga, Daisuke Ikeda, Hiroto Yasuura
2009	—	`conf`	Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. CATS Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
2009	—	`conf`	Towards Modeling Stored-value Electronic Money Systems. NaBIC Shunsuke Inenaga, Kenichirou Oyama, Hiroto Yasuura
2008	—	`conf`	An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program. Structure-Based Compression of Complex Massive Data Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
2008	B	`conf`	Computing Longest Common Substring and All Palindromes from Compressed Strings. SOFSEM Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
2008	Misc	`conf`	Parameterized Suffix Arrays for Binary Strings. PSC Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2008	J	`jnl`	Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2008	B	`conf`	String Kernels Based on Variable-Length-Don't-Care Patterns. Discovery Science Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
2007	B	`conf`	Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2007	B	`conf`	Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2006	B	`conf`	A New Family of String Classifiers Based on Local Relatedness. Discovery Science Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2006	B	`conf`	On-Line Linear-Time Construction of Word Suffix Trees. CPM Shunsuke Inenaga, Masayuki Takeda
2006	Misc	`conf`	Reachability on suffix tree graphs. PSC Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2006	C	`conf`	Sparse Directed Acyclic Word Graphs. SPIRE Shunsuke Inenaga, Masayuki Takeda
2006	Misc	`conf`	Sparse compact directed acyclic word graphs. PSC Shunsuke Inenaga, Masayuki Takeda
2005	J	`jnl`	A fully compressed pattern matching algorithm for simple collage systems. Int. J. Found. Comput. Sci. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2005	C	`conf`	Composite Pattern Discovery for PCR Application. SPIRE Stanislav Angelov, Shunsuke Inenaga
2005	B	`conf`	Fully Incremental LCS Computation. FCT Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2005	J	`jnl`	On-line construction of compact directed acyclic word graphs. Discret. Appl. Math. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
2005	B	`conf`	Practical Algorithms for Pattern Based Linear Regression. Discovery Science Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
2004	Misc	`conf`	A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. PSC Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2004	C	`conf`	An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. Developments in Language Theory Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2004	J	`jnl`	Compact directed acyclic word graphs for a sliding window. J. Discrete Algorithms Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2004	J	`jnl`	Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. J. Bioinform. Comput. Biol. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano
2004	C	`conf`	Finding Missing Patterns. WABI Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen
2004	B	`conf`	Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. Discovery Science Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004	J	`jnl`	Ternary directed acyclic word graphs. Theor. Comput. Sci. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
2003	J	`jnl`	A Note on Randomized Algorithm for String Matching with Mismatches. Nord. J. Comput. Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
2003	J	`jnl`	Bidirectional Construction of Suffix Trees. Nord. J. Comput. Shunsuke Inenaga
2003	B	`conf`	Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa
2003	B	`conf`	Inferring Strings from Graphs and Arrays. MFCS Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2003	C	`conf`	Linear-Time Off-Line Text Compression by Longest-First Substitution. SPIRE Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
2003	C	`conf`	Ternary Directed Acyclic Word Graphs. CIAA Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
2002	Misc	`conf`	A Note on Randomized Algorithm for String Matching with Mismatches. PSC Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
2002	Misc	`conf`	Bidirectional Construction of Suffix Trees. PSC Shunsuke Inenaga
2002	C	`conf`	Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2002	B	`conf`	Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2002	—	`conf`	Finding Best Patterns Practically. Progress in Discovery Science Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga
2002	B	`conf`	Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
2002	B	`conf`	The Minimum DAWG for All Suffixes of a String and Its Applications. CPM Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
2001	B	`conf`	A Practical Algorithm to Find the Best Episode Patterns. Discovery Science Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001	Misc	`conf`	Construction of the CDAWG for a Trie. PSC Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001	B	`conf`	On-Line Construction of Compact Directed Acyclic Word Graphs. CPM Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
2001	C	`conf`	On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa