Giorgi Nadiradze

Graduate School
Alistarh Group

13 Publications

Mark all

[13]
2024 | Published | Conference Paper | IST-REx-ID: 17093 | OA
Zakerinia, Hossein, et al. “Communication-Efficient Federated Learning with Data and Client Heterogeneity.” Proceedings of the 27th International Conference on Artificial Intelligence and Statistics, vol. 238, ML Research Press, 2024, pp. 3448–56.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[12]
2023 | Published | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–71, doi:10.1145/3558481.3591082.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2022 | Published | Journal Article | IST-REx-ID: 8286 | OA
Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica, vol. 84, no. 4, Springer Nature, 2022, pp. 1007–29, doi:10.1007/s00453-021-00905-9.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[10]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova, Anastasiia, et al. Multi-Queues Can Be State-of-the-Art Priority Schedulers. Zenodo, 2022, doi:10.5281/ZENODO.5733408.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[9]
2022 | Published | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova, Anastasiia, et al. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2022, pp. 353–67, doi:10.1145/3503221.3508432.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2021 | Published | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh, Dan-Adrian, et al. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” 35th International Symposium on Distributed Computing, vol. 209, 4, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.4.
[Published Version] View | Files available | DOI
 
[7]
2021 | Published | Thesis | IST-REx-ID: 10429 | OA
Nadiradze, Giorgi. On Achieving Scalability through Relaxation. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10429.
[Published Version] View | Files available | DOI
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[5]
2021 | Published | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze, Giorgi, et al. “Asynchronous Decentralized SGD with Quantized and Local Updates.” 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[4]
2021 | Published | Journal Article | IST-REx-ID: 8723 | OA
Li, Shigang, et al. “Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.” IEEE Transactions on Parallel and Distributed Systems, vol. 32, no. 7, 9271898, IEEE, 2021, doi:10.1109/TPDS.2020.3040606.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2020 | Published | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” 47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2019 | Published | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2017 | Published | Conference Paper | IST-REx-ID: 791 | OA
Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.” Proceedings of the ACM Symposium on Principles of Distributed Computing, vol. Part F129314, ACM, 2017, pp. 283–92, doi:10.1145/3087801.3087810.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

Grants


13 Publications

Mark all

[13]
2024 | Published | Conference Paper | IST-REx-ID: 17093 | OA
Zakerinia, Hossein, et al. “Communication-Efficient Federated Learning with Data and Client Heterogeneity.” Proceedings of the 27th International Conference on Artificial Intelligence and Statistics, vol. 238, ML Research Press, 2024, pp. 3448–56.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[12]
2023 | Published | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–71, doi:10.1145/3558481.3591082.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2022 | Published | Journal Article | IST-REx-ID: 8286 | OA
Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica, vol. 84, no. 4, Springer Nature, 2022, pp. 1007–29, doi:10.1007/s00453-021-00905-9.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[10]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova, Anastasiia, et al. Multi-Queues Can Be State-of-the-Art Priority Schedulers. Zenodo, 2022, doi:10.5281/ZENODO.5733408.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[9]
2022 | Published | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova, Anastasiia, et al. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2022, pp. 353–67, doi:10.1145/3503221.3508432.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2021 | Published | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh, Dan-Adrian, et al. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” 35th International Symposium on Distributed Computing, vol. 209, 4, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.4.
[Published Version] View | Files available | DOI
 
[7]
2021 | Published | Thesis | IST-REx-ID: 10429 | OA
Nadiradze, Giorgi. On Achieving Scalability through Relaxation. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10429.
[Published Version] View | Files available | DOI
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[5]
2021 | Published | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze, Giorgi, et al. “Asynchronous Decentralized SGD with Quantized and Local Updates.” 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[4]
2021 | Published | Journal Article | IST-REx-ID: 8723 | OA
Li, Shigang, et al. “Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.” IEEE Transactions on Parallel and Distributed Systems, vol. 32, no. 7, 9271898, IEEE, 2021, doi:10.1109/TPDS.2020.3040606.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[3]
2020 | Published | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” 47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2019 | Published | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2017 | Published | Conference Paper | IST-REx-ID: 791 | OA
Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.” Proceedings of the ACM Symposium on Principles of Distributed Computing, vol. Part F129314, ACM, 2017, pp. 283–92, doi:10.1145/3087801.3087810.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed