| Compressed double-array tries for string dictionaries supporting fast lookup S Kanda, K Morita, M Fuketa Knowledge and Information Systems 51, 1023-1042, 2017 | 23 | 2017 |
| Practical string dictionary compression using string dictionary encoding S Kanda, K Morita, M Fuketa 2017 International Conference on Big Data Innovations and Applications …, 2017 | 21 | 2017 |
| 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 |
| Practical implementation of space-efficient dynamic keyword dictionaries S Kanda, K Morita, M Fuketa String Processing and Information Retrieval: 24th International Symposium …, 2017 | 12 | 2017 |
| A compression method of double-array structures using linear functions S Kanda, M Fuketa, K Morita, J Aoe Knowledge and Information Systems 48, 55-80, 2016 | 11 | 2016 |
| Rank/select queries over mutable bitmaps GE Pibiri, S Kanda Information Systems 99, 101756, 2021 | 10 | 2021 |
| Succinct trit-array trie for scalable trajectory similarity search S Kanda, K Takeuchi, K Fujii, Y Tabei Proceedings of the 28th International Conference on Advances in Geographic …, 2020 | 9 | 2020 |
| Dynamic path-decomposed tries S Kanda, D Köppl, Y Tabei, K Morita, M Fuketa Journal of Experimental Algorithmics (JEA) 25, 1-28, 2020 | 8 | 2020 |
| Practical rearrangement methods for dynamic double‐array dictionaries S Kanda, Y Fujita, K Morita, M Fuketa Software: Practice and Experience 48 (1), 65-83, 2018 | 7 | 2018 |
| An optimal-time RLBWT construction in BWT-runs bounded space T Nishimoto, S Kanda, Y Tabei arXiv preprint arXiv:2202.07885, 2022 | 6 | 2022 |
| Computing NP-hard repetitiveness measures via MAX-SAT H Bannai, K Goto, M Ishihata, S Kanda, D Köppl, T Nishimoto arXiv preprint arXiv:2207.02571, 2022 | 5 | 2022 |
| Fréchet kernel for trajectory data analysis K Takeuchi, M Imaizumi, S Kanda, Y Tabei, K Fujii, K Yoda, M Ishihata, ... Proceedings of the 29th International Conference on Advances in Geographic …, 2021 | 5 | 2021 |
| 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 |
| Engineering faster double‐array Aho–Corasick automata S Kanda, K Akabe, Y Oda Software: Practice and Experience 53 (6), 1332-1361, 2023 | 2 | 2023 |
| Trie compact representation using double-array structures with string labels S Kanda, M Fuketa, K Morita, J Aoe 2015 IEEE 8th International Workshop on Computational Intelligence and …, 2015 | 2 | 2015 |
| Dynamic similarity search on integer sketches S Kanda, Y Tabei 2020 IEEE International Conference on Data Mining (ICDM), 242-251, 2020 | 1 | 2020 |
| Rank/Select Queries over Mutable Bitmaps G Ermanno Pibiri, S Kanda arXiv e-prints, arXiv: 2009.12809, 2020 | 1 | 2020 |
| b-bit sketch trie: Scalable similarity search on integer sketches S Kanda, Y Tabei 2019 IEEE International Conference on Big Data (Big Data), 810-819, 2019 | 1 | 2019 |
| Space-and time-efficient string dictionaries S Kanda 徳島大学, 2018 | 1 | 2018 |
| Experimental Observations of Construction Methods for Double Array Structures Using Linear Functions. S Kanda, K Morita, M Fuketa, JI Aoe J. Softw. 10 (6), 739-747, 2015 | 1 | 2015 |
