default search action
Giorgi Nadiradze
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Hossein Zakerinia, Shayan Talaei, Giorgi Nadiradze, Dan Alistarh:
Communication-Efficient Federated Learning With Data and Client Heterogeneity. AISTATS 2024: 3448-3456 - 2023
- [c12]Alexander Fedorov
, Diba Hashemi
Provably-Efficient and Internally-Deterministic Parallel Union-Find. SPAA 2023: 261-271 - [i12]Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh:
Provably-Efficient and Internally-Deterministic Parallel Union-Find. CoRR abs/2304.09331 (2023) - 2022
- [j3]Dan Alistarh, Giorgi Nadiradze
Dynamic Averaging Load Balancing on Cycles. Algorithmica 84(4): 1007-1029 (2022) - [j2]Dan Alistarh, Ilia Markov, Giorgi Nadiradze:
Elastic Consistency: A Consistency Criterion for Distributed Optimization. SIGACT News 53(2): 64-82 (2022) - [c11]Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, Dan Alistarh:
Multi-queues can be state-of-the-art priority schedulers. PPoPP 2022: 353-367 - [i11]Hossein Zakerinia, Shayan Talaei, Giorgi Nadiradze, Dan Alistarh:
QuAFL: Federated Averaging Can Be Both Asynchronous and Communication-Efficient. CoRR abs/2206.10032 (2022) - [i10]Shayan Talaei, Giorgi Nadiradze, Dan Alistarh:
Hybrid Decentralized Optimization: First- and Zeroth-Order Optimizers Can Be Jointly Leveraged For Faster Convergence. CoRR abs/2210.07703 (2022) - 2021
- [j1]Shigang Li
Breaking (Global) Barriers in Parallel Stochastic Optimization With Wait-Avoiding Group Averaging. IEEE Trans. Parallel Distributed Syst. 32(7): 1725-1739 (2021) - [c10]Giorgi Nadiradze, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, Dan Alistarh:
Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent. AAAI 2021: 9037-9045 - [c9]Giorgi Nadiradze, Amirmojtaba Sabour, Peter Davies, Shigang Li, Dan Alistarh:
Asynchronous Decentralized SGD with Quantized and Local Updates. NeurIPS 2021: 6829-6842 - [c8]Dan Alistarh, Rati Gelashvili, Giorgi Nadiradze:
Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention. DISC 2021: 4:1-4:17 - [i9]Dan Alistarh, Rati Gelashvili, Giorgi Nadiradze:
Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention. CoRR abs/2108.02802 (2021) - [i8]Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze, Dan Alistarh:
Multi-Queues Can Be State-of-the-Art Priority Schedulers. CoRR abs/2109.00657 (2021) - 2020
- [c7]Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour:
Dynamic Averaging Load Balancing on Cycles. ICALP 2020: 7:1-7:16 - [i7]Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour:
Dynamic Averaging Load Balancing on Cycles. CoRR abs/2003.09297 (2020) - [i6]Dan Alistarh, Nikita Koval, Giorgi Nadiradze:
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers. CoRR abs/2003.09363 (2020)
2010 – 2019
- 2019
- [c6]Dan Alistarh, Giorgi Nadiradze, Nikita Koval:
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers. SPAA 2019: 145-154 - [i5]Giorgi Nadiradze, Amirmojtaba Sabour, Aditya Sharma, Ilia Markov, Vitaly Aksenov, Dan Alistarh:
PopSGD: Decentralized Stochastic Gradient Descent in the Population Model. CoRR abs/1910.12308 (2019) - 2018
- [c5]Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze:
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. PODC 2018: 377-386 - [c4]Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze:
Distributionally Linearizable Data Structures. SPAA 2018: 133-142 - [c3]Dan Alistarh, Syed Kamran Haider, Raphael Kübler, Giorgi Nadiradze:
The Transactional Conflict Problem. SPAA 2018: 383-392 - [i4]Dan Alistarh, Syed Kamran Haider, Raphael Kübler, Giorgi Nadiradze:
The Transactional Conflict Problem. CoRR abs/1804.00947 (2018) - [i3]Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze:
Distributionally Linearizable Data Structures. CoRR abs/1804.01018 (2018) - [i2]Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze:
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. CoRR abs/1808.04155 (2018) - 2017
- [c2]Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze:
The Power of Choice in Priority Scheduling. PODC 2017: 283-292 - [i1]Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze:
The Power of Choice in Priority Scheduling. CoRR abs/1706.04178 (2017) - 2016
- [c1]Giorgi Nadiradze, Andreas Wiese
On approximating strip packing with a better ratio than 3/2. SODA 2016: 1491-1510
Coauthor Index
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-14 20:27 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: