default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShunsuke Kanda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl:
NP-Completeness for the Space-Optimality of Double-Array Tries. CoRR abs/2403.04951 (2024)- [i10]Koichi Akabe, Shunsuke Kanda, Yusuke Oda, Shinsuke Mori:
Vaporetto: Efficient Japanese Tokenization Based on Improved Pointwise Linear Classification. CoRR abs/2406.17185 (2024) - 2023
- [j11]Shunsuke Kanda
, Koichi Akabe, Yusuke Oda:
Engineering faster double-array Aho-Corasick automata. Softw. Pract. Exp. 53(6): 1332-1361 (2023) - 2022
- [j10]Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
c-trie++: A dynamic trie tailored for fast prefix searches. Inf. Comput. 285(Part): 104794 (2022) - [c10]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto:
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA 2022: 12:1-12:16 - [c9]Takaaki Nishimoto, Shunsuke Kanda, Yasuo Tabei:
An Optimal-Time RLBWT Construction in BWT-Runs Bounded Space. ICALP 2022: 99:1-99:20 - [i9]Takaaki Nishimoto, Shunsuke Kanda, Yasuo Tabei:
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space. CoRR abs/2202.07885 (2022) - [i8]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto:
Computing NP-hard Repetitiveness Measures via MAX-SAT. CoRR abs/2207.02571 (2022) - [i7]Shunsuke Kanda, Koichi Akabe, Yusuke Oda:
Engineering faster double-array Aho-Corasick automata. CoRR abs/2207.13870 (2022) - 2021
- [j9]Giulio Ermanno Pibiri, Shunsuke Kanda:
Rank/select queries over mutable bitmaps. Inf. Syst. 99: 101756 (2021) - [j8]Shunsuke Kanda, Yasuo Tabei:
DyFT: a dynamic similarity search method on integer sketches. Knowl. Inf. Syst. 63(11): 2815-2840 (2021) - [c8]Koh Takeuchi, Masaaki Imaizumi, Shunsuke Kanda, Yasuo Tabei, Keisuke Fujii, Ken Yoda, Masakazu Ishihata, Takuya Maekawa:
Fréchet Kernel for Trajectory Data Analysis. SIGSPATIAL/GIS 2021: 221-224 - 2020
- [j7]Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa:
Dynamic Path-decomposed Tries. ACM J. Exp. Algorithmics 25: 1-28 (2020) - [c7]Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC 2020: 243-252 - [c6]Shunsuke Kanda, Koh Takeuchi, Keisuke Fujii, Yasuo Tabei:
Succinct Trit-array Trie for Scalable Trajectory Similarity Search. SIGSPATIAL/GIS 2020: 518-529 - [c5]Shunsuke Kanda, Yasuo Tabei:
Dynamic Similarity Search on Integer Sketches. ICDM 2020: 242-251 - [i6]Shunsuke Kanda, Koh Takeuchi, Keisuke Fujii, Yasuo Tabei:
Succinct Trit-array Trie for Scalable Trajectory Similarity Search. CoRR abs/2005.10917 (2020) - [i5]Shunsuke Kanda, Yasuo Tabei:
Dynamic Similarity Search on Integer Sketches. CoRR abs/2009.11559 (2020) - [i4]Giulio Ermanno Pibiri, Shunsuke Kanda:
Rank/Select Queries over Mutable Bitmaps. CoRR abs/2009.12809 (2020)
2010 – 2019
- 2019
- [c4]Shunsuke Kanda, Yasuo Tabei:
b-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches. IEEE BigData 2019: 810-819 - [i3]Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Packed Compact Tries Revisited. CoRR abs/1904.07467 (2019) - [i2]Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa:
Dynamic Path-Decomposed Tries. CoRR abs/1906.06015 (2019) - [i1]Shunsuke Kanda, Yasuo Tabei:
b-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches. CoRR abs/1910.08278 (2019) - 2018
- [j6]Shunsuke Kanda, Yuma Fujita, Kazuhiro Morita, Masao Fuketa:
Practical rearrangement methods for dynamic double-array dictionaries. Softw. Pract. Exp. 48(1): 65-83 (2018) - 2017
- [j5]Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa:
Compressed double-array tries for string dictionaries supporting fast lookup. Knowl. Inf. Syst. 51(3): 1023-1042 (2017) - [c3]Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa:
Practical String Dictionary Compression Using String Dictionary Encoding. Innovate-Data 2017: 1-8 - [c2]Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa:
Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries. SPIRE 2017: 221-233 - 2016
- [j4]Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita, Jun-ichi Aoe:
A compression method of double-array structures using linear functions. Knowl. Inf. Syst. 48(1): 55-80 (2016) - 2015
- [j3]Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita, Akio Tomotoshi, Jun-ichi Aoe:
A new compression method for double-array structures by a hierarchical representation. Int. J. Intell. Syst. Technol. Appl. 14(3/4): 221-236 (2015) - [j2]Masao Fuketa, Shunsuke Kanda:
A construction method by divided double array structures. Int. J. Intell. Syst. Technol. Appl. 14(3/4): 273-283 (2015) - [j1]Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa, Jun-Ichi Aoe:
Experimental Observations of Construction Methods for Double Array Structures Using Linear Functions. J. Softw. 10(6): 739-747 (2015) - [c1]Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita, Jun-Ichi Aoe:
Trie compact representation using double-array structures with string labels. IWCIA 2015: 3-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
