19 citations · 51 across the 20 of their papers we have counts for
3 papers · 2 filters
Fast Compressed Tries through Path Decompositions
Roberto Grossi, Giuseppe Ottaviano
Tries are popular data structures for storing a set of strings, where common prefixes are represented by common root-to-node paths. Over fifty years of usage have produced many var…
Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
Consider an input text string T[1,N] drawn from an unbounded alphabet. We study partial computation in suffix-based problems for Data Compression and Text Indexing such as (I) retr…
Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings
Giovanni Battaglia, Roberto Grossi, Noemi Scutellà
A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a…