Yuto Nakashima
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
56
Venues
12
Active years
2012–2026
Best venue rank
A*
Where they publish
Papers
56 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | Sensitivity of Repetitiveness Measures to String Reversal. | Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina |
| 2026 | CPM | LZBE: An LZ-Style Compressor Supporting O(log n)-Time Random Access. | Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga |
| 2025 | CPM | On the Compressiveness of the Burrows-Wheeler Transform. | Hideo Bannai, Tomohiro I, Yuto Nakashima |
| 2025 | ESA | Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares. | Yuto Nakashima, Jakub Radoszewski, Tomasz Walen |
| 2025 | SOFSEM | Maximal α-Gapped Repeats in a Fibonacci String. | Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama |
| 2025 | SPIRE | Tight Additive Sensitivity on LZ-Style Compressors and String Attractors. | Yuto Fujie, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga |
| 2025 | SPIRE | Nyldon Factorization of Thue-Morse Words and Fibonacci Words. | Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2025 | SPIRE | Counting Distinct (Non-)crossing Substrings. | Haruki Umezaki, Hiroki Shibata, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2024 | IUI | SwipeGANSpace: Swipe-to-Compare Image Generation via Efficient Latent Space Exploration. | Yuto Nakashima, Mingzhe Yang, Yukino Baba |
| 2024 | IWOCA | Computing Maximal Palindromes in Non-standard Matching Models. | Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2024 | IWOCA | Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. | Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
| 2024 | MFCS | Edit and Alphabet-Ordering Sensitivity of Lex-Parse. | Yuto Nakashima, Dominik Kppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai |
| 2024 | SPIRE | On the Number of Non-equivalent Parameterized Squares in a String. | Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | CPM | Optimal LZ-End Parsing Is Hard. | Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno |
| 2023 | SOFSEM | Space-Efficient STR-IC-LCS Computation. | Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | SPIRE | Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. | Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue |
| 2023 | SPIRE | Largest Repetition Factorization of Fibonacci Words. | Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga |
| 2023 | SPIRE | Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. | Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2022 | CPM | Minimal Absent Words on Run-Length Encoded Strings. | Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
| 2021 | CIAC | The Parameterized Suffix Tray. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | Grammar Index by Induced Suffix Sorting. | Tooru Akagi, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | Longest Common Rollercoasters. | Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | On the Approximation Ratio of LZ-End to LZ77. | Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda |
| 2021 | SPIRE | Position Heaps for Cartesian-Tree Matching on Strings and Tries. | Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga |
| 2020 | CPM | Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara |
| 2020 | CPM | DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. | Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda |
| 2020 | DCC | c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. | Kazuya Tsuruta, Dominik Kppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SOFSEM | Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. | Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SOFSEM | Faster STR-EC-LCS Computation. | Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SPIRE | Lyndon Words, the Three Squares Lemma, and Primitive Squares. | Hideo Bannai, Takuya Mieno, Yuto Nakashima |
| 2020 | SPIRE | On Repetitiveness Measures of Thue-Morse Words. | Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SPIRE | Towards Efficient Interactive Computation of Dynamic Time Warping Distance. | Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CIAC | The Parameterized Position Heap of a Trie. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Faster Queries for Longest Substring Palindrome After Block Edit. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Computing Runs on a Trie. | Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | DCC | MR-RePair: Grammar Compression Based on Maximal Repeats. | Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida |
| 2019 | ISAAC | An Improved Data Structure for Left-Right Maximal Generic Words Problem. | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | IWOCA | Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. | Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | SPIRE | Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | SPIRE | On Longest Common Property Preserved Substring Queries. | Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka |
| 2019 | SPIRE | Compact Data Structures for Shortest Unique Substring Queries. | Takuya Mieno, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Faster Online Elastic Degenerate String Matching. | Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Longest substring palindrome after edit. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Lyndon Factorization of Grammar Compressed Texts Revisited. | Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Longest Lyndon Substring After Edit. | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | SPIRE | Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. | Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | ISAAC | Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | IWOCA | Shortest Unique Palindromic Substring Queries in Optimal Time. | Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | STACS | On the Size of Lempel-Ziv and Lyndon Factorizations. | Juha Krkkinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur |
| 2016 | SPIRE | Longest Common Abelian Factors and Large Alphabets. | Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, Shiho Sugimoto |
| 2015 | SODA | A new characterization of maximal repetitions by Lyndon trees. | Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta |
| 2014 | MFCS | Inferring Strings from Lyndon Factorization. | Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | CPM | Efficient Lyndon Factorization of Grammar Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | SPIRE | Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2012 | SPIRE | The Position Heap of a Trie. | Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |