default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Brunero
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Federico Brunero
, Petros Elia:
Multi-Access Distributed Computing. IEEE Trans. Inf. Theory 70(5): 3385-3398 (2024)- 2023
- [j2]Federico Brunero, Petros Elia:
Fundamental Limits of Combinatorial Multi-Access Caching. IEEE Trans. Inf. Theory 69(2): 1037-1056 (2023) - [c5]Federico Brunero, Kai Wan, Giuseppe Caire, Petros Elia:
Coded Distributed Computing for Sparse Functions With Structured Support. ITW 2023: 474-479 - 2022
- [b1]Federico Brunero:
Unearthing the Impact of Structure in Data and in Topology for Caching and Computing Networks. (Découvrir l'impact de la structure des données et de la topologie sur la mise en cache et les réseaux informatiques). Sorbonne University, Paris, France, 2022 - [j1]Federico Brunero, Petros Elia:
Unselfish Coded Caching Can Yield Unbounded Gains Over Selfish Caching. IEEE Trans. Inf. Theory 68(12): 7871-7891 (2022) - [c4]Federico Brunero, Petros Elia:
Coded Caching Does Not Generally Benefit From Selfish Caching. ISIT 2022: 1139-1144 - [c3]Federico Brunero, Petros Elia:
The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology. ISIT 2022: 1701-1706 - [c2]Federico Brunero, Petros Elia:
On the Optimality of Coded Caching With Heterogeneous User Profiles. ITW 2022: 166-171 - [i7]Federico Brunero, Petros Elia:
Coded Caching Does Not Generally Benefit From Selfish Caching. CoRR abs/2202.03032 (2022) - [i6]Federico Brunero, Petros Elia:
The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology. CoRR abs/2202.03039 (2022) - [i5]Federico Brunero, Petros Elia:
Multi-Access Distributed Computing. CoRR abs/2206.12851 (2022) - [i4]Federico Brunero, Petros Elia:
On the Optimality of Coded Caching With Heterogeneous User Profiles. CoRR abs/2210.06066 (2022) - 2021
- [i3]Federico Brunero, Petros Elia:
Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching. CoRR abs/2109.04807 (2021) - [i2]Federico Brunero, Petros Elia:
Fundamental Limits of Combinatorial Multi-Access Caching. CoRR abs/2110.07426 (2021)
2010 – 2019
- 2019
- [c1]Federico Brunero, Daniela Tuninetti, Natasha Devroye:
On Code Design for Wireless Channels with Additive Radar Interference. ITW 2019: 1-5 - [i1]Federico Brunero, Daniela Tuninetti, Natasha Devroye:
On Code Design for Wireless Channels with Additive Radar Interference. CoRR abs/1904.05484 (2019)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
