The “runs” theorem H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta SIAM Journal on Computing 46 (5), 1501-1514, 2017 | 156 | 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 | 40 | 2014 |
Shortest unique substrings queries in optimal time K Tsuruta, S Inenaga, H Bannai, M Takeda SOFSEM 2014: Theory and Practice of Computer Science: 40th International …, 2014 | 36 | 2014 |
Inhibition activity of essential oils obtained from Japanese trees against Skeletonema costatum K Tsuruta, Y Yoshida, N Kusumoto, N Sekine, T Ashitani, K Takahashi Journal of wood science 57, 520-525, 2011 | 24 | 2011 |
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 | 13 | 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 | 12 | 2022 |
Growth inhibition activities of Sugi bark components against Heterosigma akashiwo H Saijo, K Tsuruta, N Kusumoto, T Ashitani, K Takahashi Journal of wood science 59, 238-242, 2013 | 12 | 2013 |
Dynamic packed compact tries revisited K Tsuruta, D Köppl, S Kanda, Y Nakashima, S Inenaga, H Bannai, ... arXiv preprint arXiv:1904.07467, 2019 | 3 | 2019 |
Lyndon 木による連の特徴付け 坂内英夫, 井智弘, 中島祐人, 竹田正幸, 鶴田和弥 電子情報通信学会技術研究報告; 信学技報 114 (352), 21-21, 2014 | | 2014 |
A new characterization of maximal repetitions by Lyndon trees M Takeda, K Tsuruta arXiv preprint arXiv:1406.0263, 2014 | | 2014 |
The “Runs” Theorem M Takeda, K Tsuruta arXiv preprint arXiv:1406.0263, 2014 | | 2014 |