Roberto Bruno

According to our database, Roberto Bruno authored at least 10 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

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

Roberto Bruno, Ugo Vaccaro

CoRR, May, 2026

NP-Hardness and Approximation Algorithms for Constrained Entropy Maximization.

Roberto Bruno, Ugo Vaccaro

IEEE Trans. Inf. Theory, February, 2026

A Finite-Sample Strong Converse for Binary Hypothesis Testing via (Reverse) Rényi Divergence.

Roberto Bruno, Adrien Vandenbroucque, Amedeo Roberto Esposito

CoRR, January, 2026

Optimal average-case binary search with outcome-dependent costs.

Roberto Bruno, Roberto De Prisco, Ugo Vaccaro

Inf. Process. Lett., 2026

2025

Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications.

Roberto Bruno, Roberto De Prisco, Ugo Vaccaro

Proceedings of the IEEE International Symposium on Information Theory, 2025

Old and New Results on Alphabetic Codes.

Roberto Bruno, Roberto De Prisco, Ugo Vaccaro

Proceedings of the Information Theory and Related Fields, 2025

2024

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees.

Roberto Bruno, Roberto De Prisco, Alfredo De Santis, Ugo Vaccaro

IEEE Trans. Inf. Theory, October, 2024

Hardness and Approximability of Dimension Reduction on the Probability Simplex.

Roberto Bruno

Algorithms, July, 2024

Entropic Bounds on the Average Length of Codes with a Space.

Roberto Bruno, Ugo Vaccaro

Entropy, April, 2024

A Note on Equivalent Conditions for Majorization.

Roberto Bruno, Ugo Vaccaro

CoRR, 2024