Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
118 Publications
2021 | Conference Paper | IST-REx-ID: 9620 | 
D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 3–12.
[Preprint]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 9823 |
D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 87–105.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 11458 |
E.-A. Peste, E. B. Iofinova, A. Vladu, and D.-A. Alistarh, “AC/DC: Alternating Compressed/DeCompressed training of deep neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34, pp. 8557–8570.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 13147 |
F. Alimisis, P. Davies, and D.-A. Alistarh, “Communication-efficient distributed optimization with quantized preconditioners,” in Proceedings of the 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 196–206.
[Published Version]
View
| Files available
| arXiv
2021 | Journal Article | IST-REx-ID: 8723 |
S. Li 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. IEEE, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9827 |
B. Chatterjee, I. Walulya, and P. Tsigas, “Concurrent linearizable nearest neighbour search in LockFree-kD-tree,” Theoretical Computer Science, vol. 886. Elsevier, pp. 27–48, 2021.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 9935 |
A. Czumaj, P. Davies, and M. Parter, “Improved deterministic (Δ+1) coloring in low-space MPC,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual, Italy, 2021, pp. 469–479.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 9933 |
A. Czumaj, P. Davies, and M. Parter, “Component stability in low-space massively parallel computation,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual, Italy, 2021, pp. 481–491.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10432 |
G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 10049 |
K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in 2021 IEEE Symposium on Security and Privacy , San Francisco, CA, United States, 2021, pp. 268–284.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Conference Paper | IST-REx-ID: 10854 |
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual, Online, 2021, pp. 71–72.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 10855 |
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Thesis | IST-REx-ID: 10429 |
G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10435 |
G. Nadiradze, A. Sabour, P. Davies, S. Li, and D.-A. Alistarh, “Asynchronous decentralized SGD with quantized and local updates,” in 35th Conference on Neural Information Processing Systems, Sydney, Australia, 2021.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 9541 |
A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” ACM Transactions on Algorithms, vol. 17, no. 2. Association for Computing Machinery, 2021.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 9678 |
S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2021, pp. 129–139.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 8286 |
D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” Algorithmica. Springer Nature, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9571 |
A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, and D. M. Roy, “NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization,” Journal of Machine Learning Research, vol. 22, no. 114. Journal of Machine Learning Research, p. 1−43, 2021.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 7939 |
K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” Distributed Computing, vol. 34. Springer Nature, pp. 463–487, 2021.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv