2 code implementations • 14 Jun 2019 • Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa
Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient implementation.
1 code implementation • 1 May 2019 • Dominik Köppl
However, as can be seen by the line of research focusing on compact hash tables with open addressing, there is additional information, called displacement, required for restoring a key.
Data Structures and Algorithms
1 code implementation • 16 Apr 2019 • Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Given a dynamic set $K$ of $k$ strings of total length $n$ whose characters are drawn from an alphabet of size $\sigma$, a keyword dictionary is a data structure built on $K$ that provides locate, prefix search, and update operations on $K$.
1 code implementation • 11 Oct 2016 • Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
Given a string on an integer alphabet, we present an algorithm that computes the set of all distinct squares belonging to this string in time linear to the string length.
Data Structures and Algorithms