Bruno, Roberto
Bruno, Roberto
Dipartimento di Informatica/DI
Mostra
records
Risultati 1 - 7 di 7 (tempo di esecuzione: 0.018 secondi).
A note on equivalent conditions for majorization
2024 Bruno, Roberto; Vaccaro, Ugo
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
2024 Bruno, R.; De Prisco, R.; De Santis, A.; Vaccaro, U.
Entropic Bounds on the Average Length of Codes with a Space
2024 Bruno, R.; Vaccaro, U.
FROM SEARCH TO CODING (AND BACK): TWO SIDES OF THE SAME COIN
2026 Bruno, Roberto
NP-Hardness and Approximation Algorithms for Constrained Entropy Maximization
2026 Bruno, R.; Vaccaro, U.
Old and New Results on Alphabetic Codes
2025 Bruno, R.; De Prisco, R.; Vaccaro, U.
Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications
2025 Bruno, R.; De Prisco, R.; Vaccaro, U.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A note on equivalent conditions for majorization | 1-gen-2024 | Bruno, Roberto; Vaccaro, Ugo | |
| Bounds and Algorithms for Alphabetic Codes and Binary Search Trees | 1-gen-2024 | Bruno, R.; De Prisco, R.; De Santis, A.; Vaccaro, U. | |
| Entropic Bounds on the Average Length of Codes with a Space | 1-gen-2024 | Bruno, R.; Vaccaro, U. | |
| FROM SEARCH TO CODING (AND BACK): TWO SIDES OF THE SAME COIN | 8-mar-2026 | Bruno, Roberto | |
| NP-Hardness and Approximation Algorithms for Constrained Entropy Maximization | 1-gen-2026 | Bruno, R.; Vaccaro, U. | |
| Old and New Results on Alphabetic Codes | 1-gen-2025 | Bruno, R.; De Prisco, R.; Vaccaro, U. | |
| Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications | 1-gen-2025 | Bruno, R.; De Prisco, R.; Vaccaro, U. |