4 citations · 6 across the 4 of their papers we have counts for
4 papers
How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Given two discrete random variables and , with probability distributions and , respectively, denote by ${\cal C}(…
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi
We study a relaxation of the Vector Domination problem called Vector Connectivity (VecCon). Given a graph with a requirement for each vertex , VecCon asks for a minim…
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…
How to go Viral: Cheaply and Quickly
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +3
Given a social network represented by a graph , we consider the problem of finding a bounded cardinality set of nodes with the property that the influence spreading from …