Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Roberto Bruno
Observed name:
Bruno, Roberto
Institution:
University of Salerno
Observed institution:
University of Salerno
ORCID:
0000-0001-6039-2075
Observed ORCID:
0000-0001-6039-2075
OpenAlex ID:
A5094034761
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
2024
·
Roberto Bruno
, Roberto De Prisco
, et al.
·
IEEE Transactions on Information Theory
·
8
PDF
Old and New Results on Alphabetic Codes
2025
·
Roberto Bruno
, Roberto De Prisco
, et al.
·
Lecture notes in computer science
·
6
PDF
A note on equivalent conditions for majorization
2024
·
Roberto Bruno
, Ugo Vaccaro
·
AIMS Mathematics
·
6
The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
2026
·
Bruno, Roberto
, Vaccaro, Ugo
·
arXiv (Cornell University)
·
5
PDF
NP-Hardness and Approximation Algorithms for Constrained Entropy Maximization
2025
·
Roberto Bruno
, Ugo Vaccaro
·
IEEE Transactions on Information Theory
·
4
Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications
2025
·
Roberto Bruno
, Roberto De Prisco
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
3
PDF
Hardness and Approximability of Dimension Reduction on the Probability Simplex
2024
·
Roberto Bruno
·
Algorithms
·
3
PDF
A Finite-Sample Strong Converse for Binary Hypothesis Testing via (Reverse) Rényi Divergence
2026
·
Roberto Bruno
, Adrien Vandenbroucque
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
2
PDF
Entropic Bounds on the Average Length of Codes with a Space
2024
·
Roberto Bruno
, Ugo Vaccaro
·
Entropy
·
2
PDF
Finite-Sample Binary Hypothesis Testing via Rényi Divergences: Strong Converse and Local Privacy
2026
·
Bruno, Roberto
, Vandenbroucque, Adrien
, et al.
·
arXiv (Cornell University)
·
1
PDF
Constrained Maximum Entropy Contiguous Aggregations
2026
·
Roberto Bruno
, Ugo Vaccaro
·
IEEE International Symposium on Information Theory (ISIT)
·
1
PDF
Robust Shift-Invariant Superimposed Codes
2026
·
Roberto Bruno
, Adele Anna Rescigno
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
1
Wyner's Common Information and the Common Entropy are NP-Hard to Compute
2026
·
Bruno, Roberto
, Vaccaro, Ugo
·
arXiv (Cornell University)
PDF
An information theoretic treatment of Yager’s probability distribution negation
2026
·
Roberto Bruno
, Ugo Vaccaro
·
Soft Computing
PDF
Optimal average-case binary search with outcome-dependent costs
2026
·
Roberto Bruno
, Roberto De Prisco
, et al.
·
Information Processing Letters
Show more works
View as search
Works count:
15
Citation count:
42
H-index:
4
I10-index:
Year
Topic
Type