1.4k citations
- The University of TokyoJP116 papers
- RIKENJP81 papers
- Kyoto UniversityJP52 papers
- Keio UniversityJP38 papers
- The University of OsakaJP32 papers
- Tokyo Institute of TechnologyJP27 papers
- Japan Science and Technology AgencyJP25 papers
- National Institute for Materials ScienceJP25 papers
- University of TsukubaJP25 papers
- Japan Atomic Energy AgencyJP21 papers
- Kyushu UniversityJP18 papers
- Nagoya UniversityJP17 papers
Showing 2019 · cs.DSShow all
3 papers · 2 filters
cs.DS2019
Dynamic Path-Decomposed Tries
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei +2
A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient impl…
cs.DS2019★ 1 cited
An efficient branch-and-cut algorithm for approximately submodular function maximization
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
When approaching to problems in computer science, we often encounter situations where a subset of a finite set maximizing some utility function needs to be selected. Some of such u…
cs.DS2019★ 5 cited
c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda +4
Given a dynamic set of strings of total length whose characters are drawn from an alphabet of size , a keyword dictionary is a data structure built on that provi…