5 citations · 13 across the 10 of their papers we have counts for
4 papers · 1 filter
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
Roberto Bruno, Roberto De Prisco, Alfredo De Santis +1
Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions. In this paper, we desi…
Hardness and Approximability of Dimension Reduction on the Probability Simplex
Roberto Bruno
Dimension reduction is a technique used to transform data from a high-dimensional space into a lower-dimensional space, aiming to retain as much of the original information as poss…
A Note on Equivalent Conditions for Majorization
Roberto Bruno, Ugo Vaccaro
In this paper, we introduce novel characterizations of the classical concept of majorization in terms of upper triangular (resp., lower triangular) row-stochastic matrices, and in…
Entropic Bounds on the Average Length of Codes with a Space
Roberto Bruno, Ugo Vaccaro
We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to cons…