research
∙
05/05/2023
Verifiable Learning for Robust Tree Ensembles
Verifying the robustness of machine learning models against evasion atta...
share
research
∙
10/24/2022
Locality-Preserving Minimal Perfect Hashing of k-mers
Minimal perfect hashing is the problem of mapping a static set of n dist...
research
∙
06/04/2021
Parallel and External-Memory Construction of Minimal Perfect Hash Functions with PTHash
A minimal perfect hash function f for a set S of n keys is a bijective f...
research
∙
04/21/2021
PTHash: Revisiting FCH Minimal Perfect Hashing
Given a set S of n distinct keys, a function f that bijectively maps the...
research
∙
09/27/2020
Rank/Select Queries over Mutable Bitmaps
The problem of answering rank/select queries over a bitmap is of utmost ...
research
∙
06/25/2020
Practical Trade-Offs for the Prefix-Sum Problem
Given an integer array A, the prefix-sum problem is to answer sum(i) que...
research
∙
05/13/2020
Efficient and Effective Query Auto-Completion
Query Auto-Completion (QAC) is an ubiquitous feature of modern textual s...
research
∙
03/26/2020
Succinct Dynamic Ordered Sets with Random Access
The representation of a dynamic ordered set of n integer keys drawn from...
research
∙
08/28/2019
Techniques for Inverted Index Compression
The data structure at the core of large-scale search engines is the inve...
research
∙
07/01/2019
On Slicing Sorted Integer Sequences
Representing sorted integer sequences in small space is a central proble...
research
∙
04/16/2019
Compressed Indexes for Fast Search of Semantic Data
The sheer increase in volume of RDF data demands efficient solutions for...
research
∙
06/25/2018
Handling Massive N-Gram Datasets Efficiently
This paper deals with the two fundamental problems concerning the handli...
research
∙
04/29/2018
