U. Vaccaro

activity

20242026

most citedBounds and Algorithms for Alphabetic Codes and Binary Search Trees

5 citations · 11 across the 8 of their papers we have counts for

collaborators

Showing 2026Show all

5 papers · 1 filter

cs.IT2026

The Information Bottleneck is NP-hard

Roberto Bruno, Ugo Vaccaro

Given a joint distribution $P_{X Y}$ on a finite alphabet, the information bottleneck method seeks a representation $T$ of $X$ that is as informative as possible about $Y$ while com…

cs.IT2026

Wyner's Common Information and the Common Entropy are NP-Hard to Compute

Roberto Bruno, Ugo Vaccaro

Wyner's common information $J (p)$ and the common entropy $G (p)$ of a pair of random variables $(X, Y)$ with finite ranges and joint distribution $p$ are both defined by an optimizat…

cs.IT2026

Constrained Maximum Entropy Contiguous Aggregations

Roberto Bruno, Ugo Vaccaro

Given a probability distribution $p = (p_{1}, \dots, p_{n})$ and an integer $1 \leq m \leq n$ , a contiguous aggregation of $p$ is a probability distribution $q = (q_{1}, \dots, q_{m})$ such…

cs.IT2026

An Information Theoretic Treatment of Yager's Probability Distribution Negation

Roberto Bruno, Ugo Vaccaro

In the seminal paper (Yager 2015), Yager defined the negation of a probability distribution $p = (p_{1}, \dots, p_{n})$ , as the distribution $\overline{\mathbf{p}} = (\overline{p}…

cs.IT2026

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice

Roberto Bruno, Ugo Vaccaro

We prove that Sharma-Mittal entropy is a subadditive and supermodular function on the lattice of all $n$ -dimensional probability distributions, ordered according to the partial ord…