Search Results for author: Dominik Köppl

Found 4 papers, 4 papers with code

Dynamic Path-Decomposed Tries

2 code implementations14 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.

Separate Chaining Meets Compact Hashing

1 code implementation1 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

c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches

1 code implementation16 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$.

Computing All Distinct Squares in Linear Time for Integer Alphabets

1 code implementation11 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

Cannot find the paper you are looking for? You can Submit a new open access paper.