Publications

2026

1. ISIT 2026

   Robust Shift-Invariant Superimposed Codes

   Roberto Bruno, Adele Anna Rescigno, and Ugo Vaccaro

   In 2026 IEEE International Symposium on Information Theory (ISIT), 2026

   DOI Bib

   @inproceedings{bruno2026robust,
     title = {Robust Shift-Invariant Superimposed Codes},
     author = {Bruno, Roberto and Rescigno, Adele Anna and Vaccaro, Ugo},
     booktitle = {2026 IEEE International Symposium on Information Theory (ISIT)},
     pages = {1--6},
     year = {2026},
     organization = {IEEE},
     doi = {10.1109/ISIT62367.2026.11653677},
   }

2. ISIT 2026

   Constrained Maximum Entropy Contiguous Aggregations

   Roberto Bruno and Ugo Vaccaro

   In 2026 IEEE International Symposium on Information Theory (ISIT), 2026

   DOI arXiv Bib

   @inproceedings{bruno2026constrained,
     title = {Constrained Maximum Entropy Contiguous Aggregations},
     author = {Bruno, Roberto and Vaccaro, Ugo},
     booktitle = {2026 IEEE International Symposium on Information Theory (ISIT)},
     pages = {1--6},
     year = {2026},
     organization = {IEEE},
     doi = {10.1109/ISIT62367.2026.11654039},
   }

3. Information Processing Letters

   Optimal average-case binary search with outcome-dependent costs

   Roberto Bruno, Roberto De Prisco, and Ugo Vaccaro

   Information Processing Letters, 2026

   DOI Bib

   @article{bruno2026optimal,
     title = {Optimal average-case binary search with outcome-dependent costs},
     author = {Bruno, Roberto and De Prisco, Roberto and Vaccaro, Ugo},
     journal = {Information Processing Letters},
     pages = {106640},
     year = {2026},
     publisher = {Elsevier},
     doi = {10.1016/j.ipl.2026.106640},
   }

4. ISIT 2026

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

   Roberto Bruno, Adrien Vandenbroucque, and Amedeo Roberto Esposito

   In 2026 IEEE International Symposium on Information Theory (ISIT), 2026

   DOI arXiv Bib

   @inproceedings{bruno2026finite,
     author = {Bruno, Roberto and Vandenbroucque, Adrien and Esposito, Amedeo Roberto},
     booktitle = {2026 IEEE International Symposium on Information Theory (ISIT)},
     title = {A Finite-Sample Strong Converse for Binary Hypothesis Testing via (Reverse) {R\'enyi} Divergence},
     year = {2026},
     pages = {1-6},
     organization = {IEEE},
     doi = {10.1109/ISIT62367.2026.11653720}
   }

5. Preprint

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

   Roberto Bruno and Ugo Vaccaro

   arXiv preprint arXiv:2605.18600, 2026

   arXiv Bib

   @article{bruno2026entropy,
     title = {The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice},
     author = {Bruno, Roberto and Vaccaro, Ugo},
     journal = {arXiv preprint arXiv:2605.18600},
     year = {2026},
   }

6. Soft Computing

   An information theoretic treatment of Yager’s probability distribution negation

   Roberto Bruno and Ugo Vaccaro

   Soft Computing, 2026

   DOI arXiv Bib

   @article{bruno2026information,
     title = {An information theoretic treatment of Yager's probability distribution negation},
     author = {Bruno, Roberto and Vaccaro, Ugo},
     journal = {Soft Computing},
     pages = {1--13},
     year = {2026},
     publisher = {Springer},
     doi = {10.1007/s00500-026-11413-9},
   }

2025

1. Springer

   Old and new results on alphabetic codes

   Roberto Bruno, Roberto De Prisco, and Ugo Vaccaro

   Information Theory and Related Fields: Festschrift in Memory of Ning Cai, 2025

   DOI arXiv Bib

   @article{bruno2025old,
     title = {Old and new results on alphabetic codes},
     author = {Bruno, Roberto and De Prisco, Roberto and Vaccaro, Ugo},
     journal = {Information Theory and Related Fields: Festschrift in Memory of Ning Cai},
     pages = {151--194},
     year = {2025},
     publisher = {Springer},
     doi = {10.1007/978-3-031-82014-4_7},
   }

2. ISIT 2025

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

   Roberto Bruno, Roberto De Prisco, and Ugo Vaccaro

   In 2025 IEEE International Symposium on Information Theory (ISIT), 2025

   DOI arXiv Bib

   @inproceedings{bruno2025optimal,
     title = {Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications},
     author = {Bruno, Roberto and De Prisco, Roberto and Vaccaro, Ugo},
     booktitle = {2025 IEEE International Symposium on Information Theory (ISIT)},
     pages = {1--6},
     year = {2025},
     organization = {IEEE},
     doi = {10.1109/ISIT63088.2025.11195687},
   }

3. IEEE

   NP-Hardness and Approximation Algorithms for Constrained Entropy Maximization

   Roberto Bruno and Ugo Vaccaro

   IEEE Transactions on Information Theory, 2025

   DOI Bib

   @article{bruno2025np,
     title = {NP-Hardness and Approximation Algorithms for Constrained Entropy Maximization},
     author = {Bruno, Roberto and Vaccaro, Ugo},
     journal = {IEEE Transactions on Information Theory},
     volume = {72},
     number = {2},
     pages = {832--843},
     year = {2025},
     publisher = {IEEE},
     doi = {10.1109/TIT.2025.3644150},
   }

2024

1. IEEE

   Bounds and Algorithms for Alphabetic Codes and Binary Search Trees

   Roberto Bruno, Roberto De Prisco, Alfredo De Santis, and 1 more author

   IEEE Transactions on Information Theory, 2024

   DOI arXiv Bib

   @article{10599316,
     author = {Bruno, Roberto and De Prisco, Roberto and De Santis, Alfredo and Vaccaro, Ugo},
     journal = {IEEE Transactions on Information Theory},
     title = {Bounds and Algorithms for Alphabetic Codes and Binary Search Trees},
     year = {2024},
     volume = {70},
     number = {10},
     pages = {6974-6988},
     keywords = {Codes;Binary search trees;Symbols;Probability distribution;Upper bound;Costs;Object recognition;Alphabetic codes;searching;variable-length codes;binary search trees;data structures},
     doi = {10.1109/TIT.2024.3428699},
   }

2. AIMS Mathematics

   A note on equivalent conditions for majorization

   Roberto Bruno and Ugo Vaccaro

   AIMS Mathematics, 2024

   DOI arXiv Bib

   @article{bruno2024note,
     title = {A note on equivalent conditions for majorization},
     author = {Bruno, Roberto and Vaccaro, Ugo},
     journal = {AIMS Mathematics},
     volume = {9},
     number = {4},
     pages = {8641--8660},
     year = {2024},
     doi = {10.3934/math.2024419},
   }

3. Algorithms

   Hardness and Approximability of Dimension Reduction on the Probability Simplex

   Roberto Bruno

   Algorithms, 2024

   DOI arXiv Bib

   @article{bruno2024hardness,
     title = {Hardness and Approximability of Dimension Reduction on the Probability Simplex},
     author = {Bruno, Roberto},
     journal = {Algorithms},
     volume = {17},
     number = {7},
     pages = {296},
     year = {2024},
     publisher = {MDPI},
     doi = {10.3390/a17070296},
   }

4. Entropy

   Entropic Bounds on the Average Length of Codes with a Space

   Roberto Bruno and Ugo Vaccaro

   Entropy, 2024

   DOI arXiv Bib

   @article{bruno2024entropic,
     title = {Entropic Bounds on the Average Length of Codes with a Space},
     author = {Bruno, Roberto and Vaccaro, Ugo},
     journal = {Entropy},
     volume = {26},
     number = {4},
     pages = {283},
     year = {2024},
     publisher = {MDPI},
     doi = {10.3390/e26040283},
   }