E. Frantar, E. Kurtic, and D.-A. Alistarh, “M-FAC: Efficient matrix-free approximations of second-order information,” in 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34, pp. 14873–14886.
LibreCat: https://research-explorer.ista.ac.at/record/11463
arXiv: 2010.08222

D.-A. Alistarh and J. Korhonen, “Towards tight communication lower bounds for distributed optimisation,” in 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34, pp. 7254–7266.
LibreCat: https://research-explorer.ista.ac.at/record/11464
arXiv: 2010.08222

P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, and D.-A. Alistarh, “New bounds for distributed mean estimation and variance reduction,” in 9th International Conference on Learning Representations, Virtual, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/9543
arXiv: 2002.09268

D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in Structural Information and Communication Complexity, Wrocaw, Poland, 2021, vol. 12810, pp. 3–12.
LibreCat: https://research-explorer.ista.ac.at/record/9620
DOI: 10.1007/978-3-030-79527-6_1

D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in Structural Information and Communication Complexity, Wrocaw, Poland, 2021, vol. 12810, pp. 87–105.
LibreCat: https://research-explorer.ista.ac.at/record/9823
DOI: 10.1007/978-3-030-79527-6_6
arXiv: 2103.08949

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.
LibreCat: https://research-explorer.ista.ac.at/record/11458
arXiv: 2106.12379

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.
LibreCat: https://research-explorer.ista.ac.at/record/13147
arXiv: 2102.07214

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.
LibreCat: https://research-explorer.ista.ac.at/record/8723
DOI: 10.1109/TPDS.2020.3040606
WoS: 000621405200019
arXiv: 2005.00124

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.
LibreCat: https://research-explorer.ista.ac.at/record/9827
DOI: 10.1016/j.tcs.2021.06.041
WoS: 000694718900004

D.-A. Alistarh, M. Töpfer, and P. Uznaski, “Comparison dynamics in population protocols,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual, Italy, 2021, pp. 55–65.
LibreCat: https://research-explorer.ista.ac.at/record/9951
DOI: 10.1145/3465084.3467915
WoS: 000744439800005

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.
LibreCat: https://research-explorer.ista.ac.at/record/9935
DOI: 10.1145/3465084.3467937
WoS: 000744439800048

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.
LibreCat: https://research-explorer.ista.ac.at/record/9933
DOI: 10.1145/3465084.3467903
WoS: 000744439800049
arXiv: 2106.01880

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.
LibreCat: https://research-explorer.ista.ac.at/record/10432
arXiv: 2001.05918

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.
LibreCat: https://research-explorer.ista.ac.at/record/10049
DOI: 10.1109/sp40001.2021.00035

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.
LibreCat: https://research-explorer.ista.ac.at/record/10854
DOI: 10.1145/3410220.3453923
arXiv: 2005.07637

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.
LibreCat: https://research-explorer.ista.ac.at/record/10855
DOI: 10.1145/3447384
arXiv: 2005.07637

G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/10429
DOI: 10.15479/at:ista:10429

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.
LibreCat: https://research-explorer.ista.ac.at/record/10435
arXiv: 1910.12308

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.
LibreCat: https://research-explorer.ista.ac.at/record/9541
DOI: 10.1145/3451992
WoS: 000661311300006
arXiv: 1912.05390

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.
LibreCat: https://research-explorer.ista.ac.at/record/9678
DOI: 10.1145/3409964.3461785
arXiv: 2005.07761