default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge J. Pappas
- > Home > Persons > George J. Pappas
Publications
- 2024
[c390]Arman Adibi, Nicolò Dal Fabbro, Luca Schenato, Sanjeev R. Kulkarni, H. Vincent Poor, George J. Pappas, Hamed Hassani, Aritra Mitra:
Stochastic Approximation with Delayed Updates: Finite-Time Rates under Markovian Sampling. AISTATS 2024: 2746-2754- [c389]Nicolò Dal Fabbro
, Arman Adibi, Aritra Mitra, George J. Pappas:
Finite- Time Analysis of Asynchronous Multi-Agent TD Learning. ACC 2024: 2090-2097 - [c385]Nicolò Dal Fabbro, Arman Adibi, H. Vincent Poor, Sanjeev R. Kulkarni, Aritra Mitra, George J. Pappas:
DASA: Delay-Adaptive Multi-Agent Stochastic Approximation. CDC 2024: 3889-3896 - [i196]Arman Adibi, Nicolò Dal Fabbro, Luca Schenato, Sanjeev R. Kulkarni, H. Vincent Poor, George J. Pappas, Hamed Hassani, Aritra Mitra:
Stochastic Approximation with Delayed Updates: Finite-Time Rates under Markovian Sampling. CoRR abs/2402.11800 (2024) - [i194]Nicolò Dal Fabbro, Arman Adibi, H. Vincent Poor, Sanjeev R. Kulkarni, Aritra Mitra, George J. Pappas:
DASA: Delay-Adaptive Multi-Agent Stochastic Approximation. CoRR abs/2403.17247 (2024) - [i182]Nicolò Dal Fabbro, Arman Adibi, Aritra Mitra, George J. Pappas:
Finite-Time Analysis of Asynchronous Multi-Agent TD Learning. CoRR abs/2407.20441 (2024) - 2022
- [c347]Arman Adibi, Aritra Mitra, George J. Pappas, Hamed Hassani:
Distributed Statistical Min-Max Learning in the Presence of Byzantine Agents. CDC 2022: 4179-4184 - [c335]Aritra Mitra, Arman Adibi, George J. Pappas, Hamed Hassani:
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds. NeurIPS 2022 - [i138]Arman Adibi, Aritra Mitra, George J. Pappas, Hamed Hassani:
Distributed Statistical Min-Max Learning in the Presence of Byzantine Agents. CoRR abs/2204.03187 (2022) - [i133]Aritra Mitra, Arman Adibi, George J. Pappas, Hamed Hassani:
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds. CoRR abs/2206.02834 (2022) - 2021
- [c311]Alexander Robey, Arman Adibi, Brent Schlotfeldt, Hamed Hassani, George J. Pappas:
Optimal Algorithms for Submodular Maximization with Distributed Constraints. L4DC 2021: 150-162 - 2019
- [i71]Alexander Robey, Arman Adibi, Brent Schlotfeldt, George J. Pappas, Hamed Hassani:
Optimal Algorithms for Submodular Maximization with Distributed Constraints. CoRR abs/1909.13676 (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.
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.
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.
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 2025-10-10 00:06 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:
