Giorgi Nadiradze

Orcid: 0000-0001-5634-0731

According to our database1, Giorgi Nadiradze authored at least 17 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Provably-Efficient and Internally-Deterministic Parallel Union-Find.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022
Elastic Consistency: A Consistency Criterion for Distributed Optimization.
SIGACT News, 2022

Hybrid Decentralized Optimization: First- and Zeroth-Order Optimizers Can Be Jointly Leveraged For Faster Convergence.
CoRR, 2022

QuAFL: Federated Averaging Can Be Both Asynchronous and Communication-Efficient.
CoRR, 2022

Dynamic Averaging Load Balancing on Cycles.
Algorithmica, 2022

Multi-queues can be state-of-the-art priority schedulers.
Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

2021
Breaking (Global) Barriers in Parallel Stochastic Optimization With Wait-Avoiding Group Averaging.
IEEE Trans. Parallel Distributed Syst., 2021

Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Asynchronous Decentralized SGD with Quantized and Local Updates.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2019
PopSGD: Decentralized Stochastic Gradient Descent in the Population Model.
CoRR, 2019

Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2018
The Transactional Conflict Problem.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Distributionally Linearizable Data Structures.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
The Power of Choice in Priority Scheduling.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
On approximating strip packing with a better ratio than 3/2.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016


  Loading...