12 citations · 18 across the 9 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2019
Regular Languages meet Prefix Sorting
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti +1
Indexing strings via prefix (or suffix) sorting is, arguably, one of the most successful algorithmic techniques developed in the last decades. Can indexing be extended to languages…
cs.DS2018
String Attractors: Verification and Optimization
Dominik Kempa, Alberto Policriti, Nicola Prezza +1
String attractors [STOC 2018] are combinatorial objects recently introduced to unify all known dictionary compression techniques in a single theory. A set is a…
cs.DS2017★ 6 cited
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back
Alberto Policriti, Nicola Prezza
The Lempel-Ziv factorization (LZ77) and the Run-Length encoded Burrows-Wheeler Transform (RLBWT) are two important tools in text compression and indexing, being their sizes and…