| The “runs” theorem H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta SIAM Journal on Computing 46 (5), 1501-1514, 2017 | 125 | 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 | 39 | 2014 |
| Shortest unique substrings queries in optimal time K Tsuruta, S Inenaga, H Bannai, M Takeda International Conference on Current Trends in Theory and Practice of …, 2014 | 35 | 2014 |
| 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 | 9 | 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 | 5 | 2022 |
| Dynamic packed compact tries revisited K Tsuruta, D Köppl, S Kanda, Y Nakashima, S Inenaga, H Bannai, ... arXiv preprint arXiv:1904.07467, 2019 | 2 | 2019 |
| Compact Data Structures for Faster String Processing K Tsuruta | | 2021 |
| 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 |
Hideo BannaiProfessor, M&D Data Science Center, Tokyo Medical and Dental University, JapanDirección de correo verificada de tmd.ac.jp
