Yuto Nakashima

ORCID

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 100

Top Venues

Publications

Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga
Largest Repetition Factorization of Fibonacci Words. SPIRE (2023)
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing is Hard. CoRR (2023)
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Space-Efficient STR-IC-LCS Computation. SOFSEM (2023)
Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga
Computing SEQ-IC-LCS of Labeled Graphs. PSC (2023)
Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
On Sensitivity of Compact Directed Acyclic Word Graphs. WORDS (2023)
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga
Computing SEQ-IC-LCS of Labeled Graphs. CoRR (2023)
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR (2023)
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing Is Hard. CPM (2023)
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Linear-time computation of generalized minimal absent words for multiple strings. CoRR (2023)
Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
On Sensitivity of Compact Directed Acyclic Word Graphs. CoRR (2023)
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Space-Efficient STR-IC-LCS Computation. CoRR (2022)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. Theor. Comput. Sci. 933 (2022)
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Palindromic trees for a sliding window and its applications. Inf. Process. Lett. 173 (2022)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
c-trie++: A dynamic trie tailored for fast prefix searches. Inf. Comput. 285 (Part) (2022)
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Minimal Unique Substrings for a Sliding Window. Algorithmica 84 (3) (2022)
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Combinatorics of minimal absent words for a sliding window. Theor. Comput. Sci. 927 (2022)
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Minimal Absent Words on Run-Length Encoded Strings. CoRR (2022)
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Factorizing Strings into Repetitions. Theory Comput. Syst. 66 (2) (2022)
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing maximal generalized palindromes. CoRR (2022)
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Minimal Absent Words on Run-Length Encoded Strings. CPM (2022)
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compressed Communication Complexity of Hamming Distance. CoRR (2021)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Efficiently computing runs on a trie. Theor. Comput. Sci. 887 (2021)
Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
Position Heaps for Cartesian-Tree Matching on Strings and Tries. SPIRE (2021)
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
On the Approximation Ratio of LZ-End to LZ77. SPIRE (2021)
Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
Position Heaps for Cartesian-tree Matching on Strings and Tries. CoRR (2021)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing longest palindromic substring after single-character or block-wise edits. Theor. Comput. Sci. 859 (2021)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Suffix Tray. CIAC (2021)
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
On the approximation ratio of LZ-End to LZ77. CoRR (2021)
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Combinatorics of minimal absent words for a sliding window. CoRR (2021)
Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Longest Common Rollercoasters. SPIRE (2021)
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
Counting Lyndon Subsequences. Stringology (2021)
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
Counting Lyndon Subsequences. CoRR (2021)
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compressed Communication Complexity of Hamming Distance. Algorithms 14 (4) (2021)
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar Index By Induced Suffix Sorting. CoRR (2021)
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar Index by Induced Suffix Sorting. SPIRE (2021)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR (2020)
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13 (4) (2020)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE (2020)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. 845 (2020)
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar-compressed Self-index with Lyndon Words. CoRR (2020)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
DAWGs for parameterized matching: online construction and related indexing structures. CoRR (2020)
Hideo Bannai, Takuya Mieno, Yuto Nakashima
Lyndon Words, the Three Squares Lemma, and Primitive Squares. CoRR (2020)
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. Theory Comput. Syst. 64 (7) (2020)
Hideo Bannai, Takuya Mieno, Yuto Nakashima
Lyndon Words, the Three Squares Lemma, and Primitive Squares. SPIRE (2020)
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster STR-EC-LCS Computation. SOFSEM (2020)
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR (2020)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR (2020)
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster STR-EC-LCS Computation. CoRR (2020)
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On Repetitiveness Measures of Thue-Morse Words. SPIRE (2020)
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On repetitiveness measures of Thue-Morse words. CoRR (2020)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. CPM (2020)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC (2020)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Suffix Tray. CoRR (2020)
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. SOFSEM (2020)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM (2020)
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
An Improved Data Structure for Left-Right Maximal Generic Words Problem. ISAAC (2019)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster queries for longest substring palindrome after block edit. CoRR (2019)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic Packed Compact Tries Revisited. CoRR (2019)
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. IWOCA (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. SPIRE (2019)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compact Data Structures for Shortest Unique Substring Queries. CoRR (2019)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Queries for Longest Substring Palindrome After Block Edit. CPM (2019)
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
On Longest Common Property Preserved Substring Queries. SPIRE (2019)
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. CPM (2019)
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On the size of the smallest alphabet for Lyndon trees. Theor. Comput. Sci. 792 (2019)
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. CoRR (2019)
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
MR-RePair: Grammar Compression Based on Maximal Repeats. DCC (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Position Heap of a Trie. CIAC (2019)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Runs on a Trie. CPM (2019)
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. CoRR (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. CoRR (2019)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Maximal Palindromes and Distinct Palindromes in a Trie. Stringology (2019)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing runs on a trie. CoRR (2019)
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
On Longest Common Property Preserved Substring Queries. CoRR (2019)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Position Heap of a Trie. CoRR (2019)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compact Data Structures for Shortest Unique Substring Queries. SPIRE (2019)
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
MR-RePair: Grammar Compression based on Maximal Repeats. CoRR (2018)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Right-to-left online construction of parameterized position heaps. CoRR (2018)
Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Online Elastic Degenerate String Matching. CPM (2018)
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Longest Lyndon Substring After Edit. CPM (2018)
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms (2018)
Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Lyndon Factorization of Grammar Compressed Texts Revisited. CPM (2018)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
O(n log n)-time text compression by LZ-style longest first substitution. CoRR (2018)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Longest substring palindrome after edit. CPM (2018)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Right-to-left Online Construction of Parameterized Position Heaps. Stringology (2018)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
O(n log n)-time Text Compression by LZ-style Longest First Substitution. Stringology (2018)
Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. SPIRE (2018)
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
On the Size of Lempel-Ziv and Lyndon Factorizations. STACS (2017)
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On Reverse Engineering the Lyndon Tree. Stringology (2017)
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
The "Runs" Theorem. SIAM J. Comput. 46 (5) (2017)
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. ISAAC (2017)
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA (2017)
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Inferring strings from Lyndon factorization. Theor. Comput. Sci. 689 (2017)
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest unique palindromic substring queries in optimal time. CoRR (2016)
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theor. Comput. Sci. 656 (2016)
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
On the Size of Lempel-Ziv and Lyndon Factorizations. CoRR (2016)
Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, Shiho Sugimoto
Longest Common Abelian Factors and Large Alphabets. SPIRE (2016)
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
) Time. Stringology (2016)

Yuto Nakashima.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yuto Nakashima