Roberto Bruno

14 papers B 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Finite-Sample Strong Converse for Binary Hypothesis Testing via (Reverse) Rényi Divergence.
CoRR
Roberto Bruno, Adrien Vandenbroucque, Amedeo Roberto Esposito
2026 J jnl
NP-Hardness and Approximation Algorithms for Constrained Entropy Maximization.
IEEE Trans. Inf. Theory
Roberto Bruno, Ugo Vaccaro
2026 J jnl
Optimal average-case binary search with outcome-dependent costs.
Inf. Process. Lett.
Roberto Bruno, Roberto De Prisco, Ugo Vaccaro
2025 — conf
Old and New Results on Alphabetic Codes.
Information Theory and Related Fields
Roberto Bruno, Roberto De Prisco, Ugo Vaccaro
2025 J jnl
Old and New Results on Alphabetic Codes.
CoRR
Roberto Bruno, Roberto De Prisco, Ugo Vaccaro
2025 B conf
Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications.
ISIT
Roberto Bruno, Roberto De Prisco, Ugo Vaccaro
2025 J jnl
Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications.
CoRR
Roberto Bruno, Roberto De Prisco, Ugo Vaccaro
2024 J jnl
A Note on Equivalent Conditions for Majorization.
CoRR
Roberto Bruno, Ugo Vaccaro
2024 J jnl
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees.
CoRR
Roberto Bruno, Roberto De Prisco, Alfredo De Santis, Ugo Vaccaro
2024 J jnl
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees.
IEEE Trans. Inf. Theory
Roberto Bruno, Roberto De Prisco, Alfredo De Santis, Ugo Vaccaro
2024 J jnl
Entropic Bounds on the Average Length of Codes with a Space.
CoRR
Roberto Bruno, Ugo Vaccaro
2024 J jnl
Entropic Bounds on the Average Length of Codes with a Space.
Entropy
Roberto Bruno, Ugo Vaccaro
2024 J jnl
Hardness and Approximability of Dimension Reduction on the Probability Simplex.
Algorithms
Roberto Bruno
2024 J jnl
Hardness and Approximability of Dimension Reduction on the Probability Simplex.
CoRR
Roberto Bruno