Given a set S of n distinct keys, a function f that bijectively maps the keys of S into the range
(0,..., n-1) is called a minimal perfect hash function for S. Algorithms that find such functions …

Motivation Minimal perfect hashing is the problem of mapping a static set of n distinct keys
into the address space {1,…, n} bijectively. It is well-known that n log 2 (e) bits are necessary …

We consider the problem of representing a set of k-mers and their abundance counts, or
weights, in compressed space so that assessing membership and retrieving the weight of ak …

We address the problem of compressing and indexing a sorted dictionary of strings to
support efficient lookups and more sophisticated operations, such as prefix, predecessor …

A function is a minimal perfect hash function for a set of size, if bijectively maps into the first
natural numbers. These functions are important for many practical applications in computing …

Two fundamental problems concern the handling of large n-gram language models:
indexing, that is, compressing the n-grams and associated satellite values without …

String dictionaries are a core component of a plethora of applications, so it is not surprising
that they have been widely and deeply investigated in the literature since the introduction of …

Query Auto-Completion (QAC) is an ubiquitous feature of modern textual search systems,
suggesting possible ways of completing the query being typed by the user. Efficiency is …

The sheer increase in volume of RDF data demands efficient solutions for the triple indexing
problem, that is to devise a compressed data structure to compactly represent RDF triples by …

Multiple pattern matching in strings is a fundamental problem in text processing applications
such as regular expressions or tokenization. This article studies efficient implementations of …