Verifying the robustness of machine learning models against evasion atta...
Minimal perfect hashing is the problem of mapping a static set of n
dist...
A minimal perfect hash function f for a set S of n keys is a bijective
f...
Given a set S of n distinct keys, a function f that bijectively maps
the...
The problem of answering rank/select queries over a bitmap is of utmost
...
Given an integer array A, the prefix-sum problem is to answer sum(i) que...
Query Auto-Completion (QAC) is an ubiquitous feature of modern textual s...
The representation of a dynamic ordered set of n integer keys drawn from...
The data structure at the core of large-scale search engines is the inve...
Representing sorted integer sequences in small space is a central proble...
The sheer increase in volume of RDF data demands efficient solutions for...
This paper deals with the two fundamental problems concerning the handli...
The ubiquitous Variable-Byte encoding is considered one of the fastest
c...