70 citations · 190 across the 15 of their papers we have counts for
4 papers · 1 filter
Rank/Select Queries over Mutable Bitmaps
Giulio Ermanno Pibiri, Shunsuke Kanda
The problem of answering rank/select queries over a bitmap is of utmost importance for many succinct data structures. When the bitmap does not change, many solutions exist in the t…
Efficient and Effective Query Auto-Completion
Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini
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 cruci…
Practical Trade-Offs for the Prefix-Sum Problem
Giulio Ermanno Pibiri, Rossano Venturini
Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of the elements in A[0..i], knowing that the integers in A can be changed. It is a…
Succinct Dynamic Ordered Sets with Random Access
Giulio Ermanno Pibiri, Rossano Venturini
The representation of a dynamic ordered set of integer keys drawn from a universe of size is a fundamental data structuring problem. Many solutions to this problem achieve…