4 papers
Bounds on the Entropy of a Function of a Random Variable and their Applications
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
It is well known that the entropy of a discrete random variable is always greater than or equal to the entropy of a function of , with equality if and o…
Partial Covering Arrays: Algorithms and Asymptotics
Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis +1
A covering array is an array with entries in , for which every subarray contains each -tuple of $\{1, 2, \ld…
Spread of Influence in Weighted Networks under Time and Budget Constraints
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +3
Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading from S in G, within a…
Superselectors: Efficient Constructions and Applications
Ferdinando Cicalese, Ugo Vaccaro
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve pr…