| Fundamental limits of combinatorial multi-access caching F Brunero, P Elia IEEE Transactions on Information Theory 69 (2), 1037-1056, 2022 | 30 | 2022 |
| Unselfish coded caching can yield unbounded gains over selfish caching F Brunero, P Elia IEEE Transactions on Information Theory 68 (12), 7871-7891, 2022 | 12* | 2022 |
| The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology F Brunero, P Elia 2022 IEEE International Symposium on Information Theory (ISIT), 1701-1706, 2022 | 5 | 2022 |
| On code design for wireless channels with additive radar interference F Brunero, D Tuninetti, N Devroye 2019 IEEE Information Theory Workshop (ITW), 1-5, 2019 | 5 | 2019 |
| Multi-access distributed computing F Brunero, P Elia IEEE Transactions on Information Theory, 2024 | 3 | 2024 |
| Coded distributed computing for sparse functions with structured support F Brunero, K Wan, G Caire, P Elia 2023 IEEE Information Theory Workshop (ITW), 474-479, 2023 | 2 | 2023 |
| Unearthing the Impact of Structure in Data and in Topology for Caching and Computing Networks F Brunero Sorbonne Université, 2022 | | 2022 |
| On the Optimality of Coded Caching With Heterogeneous User Profiles F Brunero, P Elia 2022 IEEE Information Theory Workshop (ITW), 166-171, 2022 | | 2022 |
| Coded Caching Does Not Generally Benefit From Selfish Caching F Brunero, P Elia 2022 IEEE International Symposium on Information Theory (ISIT), 1139-1144, 2022 | | 2022 |
| Low-Density Parity-Check Code Design for the AWGN Channel with Additive Radar Interference F Brunero Politecnico di Torino, 2019 | | 2019 |
Petros EliaProfessor, Communication Systems Department, EurecomVerified email at eurecom.fr
