Trie compact representation using double-array structures with string labels. - Shunsuke Kanda; Masao Fuketa; Kazuhiro Morita; Jun-Ichi Aoe (IWCIA, 2015)

A construction method by divided double array structures. - Masao Fuketa; Shunsuke Kanda (Int. J. Intell. Syst. Technol. Appl., 2015)

A new compression method for double-array structures by a hierarchical representation. - Shunsuke Kanda; Masao Fuketa; Kazuhiro Morita; Akio Tomotoshi; Jun-ichi Aoe (Int. J. Intell. Syst. Technol. Appl., 2015)

Experimental Observations of Construction Methods for Double Array Structures Using Linear Functions. - Shunsuke Kanda; Kazuhiro Morita; Masao Fuketa; Jun-Ichi Aoe (J. Softw., 2015)

A compression method of double-array structures using linear functions. - Shunsuke Kanda; Masao Fuketa; Kazuhiro Morita; Jun-ichi Aoe (Knowl. Inf. Syst., 2016)

Practical String Dictionary Compression Using String Dictionary Encoding. - Shunsuke Kanda; Kazuhiro Morita; Masao Fuketa (Innovate-Data, 2017)

Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries. - Shunsuke Kanda; Kazuhiro Morita; Masao Fuketa (SPIRE, 2017)

Compressed double-array tries for string dictionaries supporting fast lookup. - Shunsuke Kanda; Kazuhiro Morita; Masao Fuketa (Knowl. Inf. Syst., 2017)

Practical rearrangement methods for dynamic double-array dictionaries. - Shunsuke Kanda; Yuma Fujita; Kazuhiro Morita; Masao Fuketa (Softw. Pract. Exp., 2018)

b-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches. - Shunsuke Kanda; Yasuo Tabei (IEEE BigData, 2019)

Dynamic Packed Compact Tries Revisited. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2019)

Succinct Trit-array Trie for Scalable Trajectory Similarity Search. - Shunsuke Kanda; Koh Takeuchi 001; Keisuke Fujii 001; Yasuo Tabei (SIGSPATIAL/GIS, 2020)

Dynamic Similarity Search on Integer Sketches. - Shunsuke Kanda; Yasuo Tabei (ICDM, 2020)

Dynamic Path-decomposed Tries. - Shunsuke Kanda; Dominik Köppl; Yasuo Tabei; Kazuhiro Morita; Masao Fuketa (ACM J. Exp. Algorithmics, 2020)

Fréchet Kernel for Trajectory Data Analysis. - Koh Takeuchi 001; Masaaki Imaizumi; Shunsuke Kanda; Yasuo Tabei; Keisuke Fujii 001; Ken Yoda; Masakazu Ishihata; Takuya Maekawa (SIGSPATIAL/GIS, 2021)

Rank/select queries over mutable bitmaps. - Giulio Ermanno Pibiri; Shunsuke Kanda (Inf. Syst., 2021)

DyFT: a dynamic similarity search method on integer sketches. - Shunsuke Kanda; Yasuo Tabei (Knowl. Inf. Syst., 2021)

Computing NP-Hard Repetitiveness Measures via MAX-SAT. - Hideo Bannai; Keisuke Goto 001; Masakazu Ishihata; Shunsuke Kanda; Dominik Köppl; Takaaki Nishimoto (ESA, 2022)

An Optimal-Time RLBWT Construction in BWT-Runs Bounded Space. - Takaaki Nishimoto; Shunsuke Kanda; Yasuo Tabei (ICALP, 2022)

c-trie++: A dynamic trie tailored for fast prefix searches. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Comput., 2022)

Engineering faster double-array Aho-Corasick automata. - Shunsuke Kanda; Koichi Akabe; Yusuke Oda (Softw. Pract. Exp., 2023)

NP-Completeness for the Space-Optimality of Double-Array Tries. - Hideo Bannai; Keisuke Goto 001; Shunsuke Kanda; Dominik Köppl (CoRR, 2024)

Vaporetto: Efficient Japanese Tokenization Based on Improved Pointwise Linear Classification. - Koichi Akabe; Shunsuke Kanda; Yusuke Oda; Shinsuke Mori (CoRR, 2024)