Yuto Nakashima

135 papers A* 1A 2B 21C 27Misc 8Journal 73Unranked 3
YearRankTypeTitle / Venue / Authors
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
Computing maximal palindromes in non-standard matching models.
Inf. Comput.
Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
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
Fast Computation of
CoRR
Yuto Nakashima, Jakub Radoszewski, Tomasz Walen
2025 A conf
Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares.
ESA
Yuto Nakashima, Jakub Radoszewski, Tomasz Walen
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 — conf
Maximal α-Gapped Repeats in a Fibonacci String.
SOFSEM (2)
Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama
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 B conf
On the Compressiveness of the Burrows-Wheeler Transform.
CPM
Hideo Bannai, Tomohiro I, Yuto Nakashima
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 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 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 space-efficient STR-IC-LCS computation.
Theor. Comput. Sci.
Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
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
On the compressiveness of the Burrows-Wheeler transform.
CoRR
Hideo Bannai, Tomohiro I, Yuto Nakashima
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 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 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 B conf
Optimal LZ-End Parsing Is Hard.
CPM
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023 J jnl
Optimal LZ-End Parsing is Hard.
CoRR
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
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 B conf
Space-Efficient STR-IC-LCS Computation.
SOFSEM
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
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 J jnl
Computing maximal generalized palindromes.
CoRR
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
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 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
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
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 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 C conf
The Parameterized Suffix Tray.
CIAC
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
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
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
Grammar-compressed Self-index with Lyndon Words.
CoRR
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 C conf
Lyndon Words, the Three Squares Lemma, and Primitive Squares.
SPIRE
Hideo Bannai, Takuya Mieno, Yuto Nakashima
2020 J jnl
Lyndon Words, the Three Squares Lemma, and Primitive Squares.
CoRR
Hideo Bannai, Takuya Mieno, Yuto Nakashima
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 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 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 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 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 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 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
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 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
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 J jnl
Inferring strings from Lyndon factorization.
Theor. Comput. Sci.
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 Misc conf
On Reverse Engineering the Lyndon Tree.
PSC
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 A conf
On the Size of Lempel-Ziv and Lyndon Factorizations.
STACS
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
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 J jnl
The "Runs" Theorem.
SIAM J. Comput.
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
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
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
Longest Common Abelian Factors and Large Alphabets.
SPIRE
Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, Shiho Sugimoto
2016 J jnl
On the Size of Lempel-Ziv and Lyndon Factorizations.
CoRR
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
2016 J jnl
Shortest unique palindromic substring queries in optimal time.
CoRR
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
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 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
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 — conf
Inferring Strings from Lyndon Factorization.
MFCS (2)
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
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 C conf
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text.
SPIRE
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2012 C conf
The Position Heap of a Trie.
SPIRE
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda