4 citations · 6 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
On the complexity and approximability of Bounded access Lempel Ziv coding
Ferdinando Cicalese, Francesca Ugazio
We study the complexity of constructing an optimal parsing of a string under the constraint that given a position in the original text, and the LZ…
cs.DS2014★ 2 cited
Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model
Aline Saettler, Eduardo Laber, Ferdinando Cicalese
We study the problem of evaluating a discrete function by adaptively querying the values of its variables until the values read uniquely determine the value of the function. Readin…