| The “runs” theorem H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta SIAM Journal on Computing 46 (5), 1501-1514, 2017 | 174 | 2017 |
| A new characterization of maximal repetitions by Lyndon trees H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 43 | 2014 |
| Faster online elastic degenerate string matching K Aoyama, Y Nakashima, S Inenaga, H Bannai, M Takeda 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 9: 1-9: 10, 2018 | 31 | 2018 |
| On repetitiveness measures of Thue-Morse words K Kutsukake, T Matsumoto, Y Nakashima, S Inenaga, H Bannai, ... International Symposium on String Processing and Information Retrieval, 213-220, 2020 | 27 | 2020 |
| MR-RePair: Grammar compression based on maximal repeats I Furuya, T Takagi, Y Nakashima, S Inenaga, H Bannai, T Kida 2019 Data Compression Conference (DCC), 508-517, 2019 | 26 | 2019 |
| Constructing LZ78 tries and position heaps in linear time for large alphabets Y Nakashima, I Tomohiro, S Inenaga, H Bannai, M Takeda Information Processing Letters 115 (9), 655-659, 2015 | 22 | 2015 |
| Faster Lyndon factorization algorithms for SLP and LZ78 compressed text I Tomohiro, Y Nakashima, S Inenaga, H Bannai, M Takeda Theoretical Computer Science 656, 215-224, 2016 | 21 | 2016 |
| On the size of Lempel-Ziv and Lyndon factorizations J Kärkkäinen, D Kempa, Y Nakashima, SJ Puglisi, AM Shur arXiv preprint arXiv:1611.08898, 2016 | 20 | 2016 |
| Minimal unique substrings and minimal absent words in a sliding window T Mieno, Y Kuhara, T Akagi, Y Fujishige, Y Nakashima, S Inenaga, ... International Conference on Current Trends in Theory and Practice of …, 2020 | 19 | 2020 |
| c-trie++: A dynamic trie tailored for fast prefix searches K Tsuruta, D Köppl, S Kanda, Y Nakashima, S Inenaga, H Bannai, ... Information and Computation 285, 104794, 2022 | 16 | 2022 |
| Right-to-left online construction of parameterized position heaps N Fujisato, Y Nakashima, S Inenaga, H Bannai, M Takeda arXiv preprint arXiv:1808.01071, 2018 | 15 | 2018 |
| Grammar-compressed self-index with Lyndon words K Tsuruta, D Köppl, Y Nakashima, S Inenaga, H Bannai, M Takeda arXiv preprint arXiv:2004.05309, 2020 | 14 | 2020 |
| Algorithms and combinatorial properties on shortest unique palindromic substrings H Inoue, Y Nakashima, T Mieno, S Inenaga, H Bannai, M Takeda Journal of Discrete Algorithms 52, 122-132, 2018 | 14 | 2018 |
| Longest substring palindrome after edit M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 12: 1-12: 14, 2018 | 14 | 2018 |
| Longest Lyndon substring after edit Y Urabe, Y Nakashima, S Inenaga, H Bannai, M Takeda 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 19: 1-19: 10, 2018 | 14 | 2018 |
| The position heap of a trie Y Nakashima, T I, S Inenaga, H Bannai, M Takeda String Processing and Information Retrieval: 19th International Symposium …, 2012 | 14 | 2012 |
| Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets N Fujisato, Y Nakashima, S Inenaga, H Bannai, M Takeda International Symposium on String Processing and Information Retrieval, 382-391, 2019 | 12 | 2019 |
| On the size of overlapping Lempel-Ziv and Lyndon factorizations Y Urabe, Y Nakashima, S Inenaga, H Bannai, M Takeda 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 29: 1-29: 11, 2019 | 12 | 2019 |
| Computing longest palindromic substring after single-character or block-wise edits M Funakoshi, Y Nakashima, S Inenaga, H Bannai, M Takeda Theoretical Computer Science 859, 116-133, 2021 | 11 | 2021 |
| Compressed Communication Complexity of Hamming Distance S Mitsuya, Y Nakashima, S Inenaga, H Bannai, M Takeda Algorithms 14 (4), 116, 2021 | 9 | 2021 |
