default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiovanni Neglia
- > Home > Persons > Giovanni Neglia
Publications
- 2024
[j42]Angelo Rodio
, Francescomaria Faticanti, Othmane Marfoq, Giovanni Neglia, Emilio Leonardi:
Federated Learning Under Heterogeneous and Correlated Client Availability. IEEE/ACM Trans. Netw. 32(2): 1451-1460 (2024)- [i38]Franco Galante, Giovanni Neglia, Emilio Leonardi:
Scalable Decentralized Algorithms for Online Personalized Mean Estimation. CoRR abs/2402.12812 (2024) - 2023
- [j40]Anirudh Sabnis, Tareq Si Salem, Giovanni Neglia, Michele Garetto, Emilio Leonardi, Ramesh K. Sitaraman:
GRADES: Gradient Descent for Similarity Caching. IEEE/ACM Trans. Netw. 31(1): 30-41 (2023) - [c83]Angelo Rodio, Francescomaria Faticanti, Othmane Marfoq, Giovanni Neglia, Emilio Leonardi:
Federated Learning under Heterogeneous and Correlated Client Availability. INFOCOM 2023: 1-10 - [i33]Angelo Rodio, Francescomaria Faticanti, Othmane Marfoq, Giovanni Neglia, Emilio Leonardi:
Federated Learning under Heterogeneous and Correlated Client Availability. CoRR abs/2301.04632 (2023) - 2022
- [j35]Giovanni Neglia, Michele Garetto, Emilio Leonardi:
Similarity Caching: Theory and Algorithms. IEEE/ACM Trans. Netw. 30(2): 475-486 (2022) - 2021
- [j33]Michele Garetto, Emilio Leonardi, Giovanni Neglia:
Content placement in networks of similarity caches. Comput. Networks 201: 108570 (2021) - [j29]Giovanni Neglia, Emilio Leonardi, Guilherme Iecker Ricardo, Thrasyvoulos Spyropoulos:
A Swiss Army Knife for Online Caching in Small Cell Networks. IEEE/ACM Trans. Netw. 29(6): 2536-2547 (2021) - [c71]Anirudh Sabnis, Tareq Si Salem, Giovanni Neglia, Michele Garetto, Emilio Leonardi, Ramesh K. Sitaraman:
GRADES: Gradient Descent for Similarity Caching. INFOCOM 2021: 1-10 - [i22]Michele Garetto, Emilio Leonardi, Giovanni Neglia:
Content Placement in Networks of Similarity Caches. CoRR abs/2102.04974 (2021) - 2020
- [c65]Michele Garetto, Emilio Leonardi, Giovanni Neglia:
Similarity Caching: Theory and Algorithms. INFOCOM 2020: 526-535 - 2019
- [i11]Michele Garetto, Emilio Leonardi, Giovanni Neglia:
Similarity Caching: Theory and Algorithms. CoRR abs/1912.03888 (2019) - 2018
- [j23]Emilio Leonardi, Giovanni Neglia:
Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles. IEEE J. Sel. Areas Commun. 36(6): 1276-1285 (2018) - [i9]Emilio Leonardi, Giovanni Neglia:
Implicit Coordination of Caches in Small Cell Networks under Unknown Popularity Profiles. CoRR abs/1804.01895 (2018)
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-09-04 01:21 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:
