Yuto Nakashima

Most-cited papers

The "Runs" Theorem
Hideo Bannai, I. Tomohiro, Shunsuke Inenaga, Yuto Nakashima +2 more
2014SIAM journal on computing (Print)148 citations Open access
Semantic Scholar
A new characterization of maximal repetitions by Lyndon trees
Hideo Bannai, I. Tomohiro, Shunsuke Inenaga, Yuto Nakashima +2 more
2014ACM-SIAM Symposium on Discrete Algorithms47 citations
Semantic Scholar
Faster Online Elastic Degenerate String Matching
Kotaro Aoyama, Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga +2 more
2018Annual Symposium on Combinatorial Pattern Matching32 citations
Semantic Scholar
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text
I. Tomohiro, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2013SPIRE30 citations
Semantic Scholar
On repetitiveness measures of Thue-Morse words
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga +2 more
2020SPIRE29 citations Open access
Semantic Scholar
MR-RePair: Grammar Compression Based on Maximal Repeats
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga +2 more
2018Data Compression Conference20 citations
Semantic Scholar
On the Size of Lempel-Ziv and Lyndon Factorizations
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, S. Puglisi +1 more
2016Symposium on Theoretical Aspects of Computer Science18 citations Open access
Semantic Scholar
Constructing LZ78 tries and position heaps in linear time for large alphabets
Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai +1 more
2015Information Processing Letters17 citations Open access
Semantic Scholar
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige +4 more
2019Conference on Current Trends in Theory and Practice of Informatics16 citations Open access
Semantic Scholar
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches
Kazuya Tsuruta, D. Köppl, Shunsuke Kanda, Yuto Nakashima +3 more
2019Data Compression Conference16 citations Open access
Semantic Scholar
Computing longest palindromic substring after single-character or block-wise edits
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2021Theoretical Computer Science15 citations Open access
Semantic Scholar
Longest Lyndon Substring After Edit
Y. Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2018Annual Symposium on Combinatorial Pattern Matching15 citations
Semantic Scholar
Longest substring palindrome after edit
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2018Annual Symposium on Combinatorial Pattern Matching12 citations
Semantic Scholar
Inferring strings from Lyndon factorization
Yuto Nakashima, Takashi Okabe, I. Tomohiro, Shunsuke Inenaga +2 more
2014Theoretical Computer Science12 citations Open access
Semantic Scholar
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations
Y. Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2019Annual Symposium on Combinatorial Pattern Matching11 citations
Semantic Scholar
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2019SPIRE11 citations Open access
Semantic Scholar
Right-to-left online construction of parameterized position heaps
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2018Prague Stringology Conference11 citations
Semantic Scholar
Algorithms and combinatorial properties on shortest unique palindromic substrings
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga +2 more
2018J. Discrete Algorithms11 citations Open access
Semantic Scholar
The Position Heap of a Trie
Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai +1 more
2012SPIRE11 citations
Semantic Scholar
Grammar-compressed Self-index with Lyndon Words
Kazuya Tsuruta, D. Köppl, Yuto Nakashima, Shunsuke Inenaga +2 more
2020arXiv.org10 citations
Semantic Scholar
Faster queries for longest substring palindrome after block edit
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2019Annual Symposium on Combinatorial Pattern Matching10 citations
Semantic Scholar
Computing Minimal Unique Substrings for a Sliding Window
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga +2 more
2021Algorithmica9 citations Open access
Semantic Scholar
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2019Theory of Computing Systems8 citations Open access
Semantic Scholar
Computing maximal palindromes in non-standard matching models
Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga +2 more
2022Information and Computation7 citations Open access
Semantic Scholar
Position Heaps for Cartesian-tree Matching on Strings and Tries
A. Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
2021SPIRE7 citations Open access
Semantic Scholar
Compressed Communication Complexity of Hamming Distance
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2021Algorithms7 citations Open access
Semantic Scholar
Palindromic trees for a sliding window and its applications
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga +2 more
2020Information Processing Letters7 citations Open access
Semantic Scholar
The Parameterized Position Heap of a Trie
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2019International/Italian Conference on Algorithms and Complexity7 citations Open access
Semantic Scholar
Efficient Lyndon Factorization of Grammar Compressed Text
I. Tomohiro, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2012Annual Symposium on Combinatorial Pattern Matching7 citations Open access
Semantic Scholar
Factorizing Strings into Repetitions
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga +2 more
2022Theory of Computing Systems6 citations
Semantic Scholar
Grammar Index By Induced Suffix Sorting
Tooru Akagi, D. Köppl, Yuto Nakashima, Shunsuke Inenaga +2 more
2021SPIRE6 citations Open access
Semantic Scholar
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima +5 more
2020Theoretical Computer Science6 citations Open access
Semantic Scholar
Computing runs on a trie
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2019Annual Symposium on Combinatorial Pattern Matching6 citations
Semantic Scholar
Dynamic Packed Compact Tries Revisited
Kazuya Tsuruta, D. Köppl, Shunsuke Kanda, Yuto Nakashima +3 more
2019arXiv.org6 citations
Semantic Scholar
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
I. Tomohiro, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2016Theoretical Computer Science6 citations Open access
Semantic Scholar
Largest Repetition Factorization of Fibonacci Words
Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga
2023SPIRE5 citations
Semantic Scholar
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima +1 more
2023SPIRE5 citations Open access
Semantic Scholar
Combinatorics of minimal absent words for a sliding window
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima +3 more
2021Theoretical Computer Science5 citations Open access
Semantic Scholar
Longest Common Rollercoasters
K. Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2021SPIRE5 citations
Semantic Scholar
DAWGs for parameterized matching: online construction and related indexing structures
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima +5 more
2020Annual Symposium on Combinatorial Pattern Matching5 citations
Semantic Scholar
Compact Data Structures for Shortest Unique Substring Queries
Takuya Mieno, D. Köppl, Yuto Nakashima, Shunsuke Inenaga +2 more
2019SPIRE5 citations
Semantic Scholar
Lyndon Factorization of Grammar Compressed Texts Revisited
Isamu Furuya, Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga +2 more
2018Annual Symposium on Combinatorial Pattern Matching5 citations
Semantic Scholar
Longest Common Abelian Factors and Large Alphabets
Golnaz Badkobeh, T. Gagie, S. Grabowski, Yuto Nakashima +2 more
2016SPIRE5 citations
Semantic Scholar
LZSE: an LZ-style compressor supporting O(log n)-time random access
Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga
2025Annual Symposium on Combinatorial Pattern Matching4 citations
Semantic Scholar
On the compressiveness of the Burrows-Wheeler transform
Hideo Bannai, I. Tomohiro, Yuto Nakashima
2024Annual Symposium on Combinatorial Pattern Matching4 citations
Semantic Scholar
Edit and Alphabet-Ordering Sensitivity of Lex-parse
Yuto Nakashima, D. Köppl, Mitsuru Funakoshi, Shunsuke Inenaga +1 more
2024International Symposium on Mathematical Foundations of Computer Science4 citations
Semantic Scholar
Minimal Absent Words on Run-Length Encoded Strings
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima +1 more
2022Annual Symposium on Combinatorial Pattern Matching4 citations
Semantic Scholar
On the approximation ratio of LZ-End to LZ77
Taku Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima +2 more
2021SPIRE4 citations Open access
Semantic Scholar
The Parameterized Suffix Tray
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2020International/Italian Conference on Algorithms and Complexity4 citations Open access
Semantic Scholar
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1 more
2019International Workshop on Combinatorial Algorithms4 citations Open access
Semantic Scholar