Dynamic elias-fano representation
GE Pibiri, R Venturini - 28th Annual symposium on combinatorial …, 2017 - drops.dagstuhl.de
We show that it is possible to store a dynamic ordered set S of n integers drawn from a
bounded universe of size u in space close to the information-theoretic lower bound and …
bounded universe of size u in space close to the information-theoretic lower bound and …
Boosting perturbation-based iterative algorithms to compute the median string
The most competitive heuristics for calculating the median string are those that use
perturbation-based iterative algorithms. Given the complexity of this problem, which under …
perturbation-based iterative algorithms. Given the complexity of this problem, which under …
New initialization for algorithms to solve median string problem
The median string problem is NP-hard under several formulations, being the most
competitive heuristics those using perturbation-based iterative algorithms. The initial string …
competitive heuristics those using perturbation-based iterative algorithms. The initial string …
Space and Time-Efficient Data Structures for Massive Datasets
GE Pibiri - 2019 - tesidottorato.depositolegale.it
This thesis concerns the design of compressed data structures for the efficient storage of
massive datasets of integer sequences and short strings. The studied problems arise in …
massive datasets of integer sequences and short strings. The studied problems arise in …