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

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. 143, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/9571
arXiv: 1908.06077

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.
LibreCat: https://research-explorer.ista.ac.at/record/7939
DOI: 10.1007/s00446-020-00380-5
WoS: 000556444600001
arXiv: 1903.05956

A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in congested clique and MPC,” SIAM Journal on Computing, vol. 50, no. 5. Society for Industrial &; Applied Mathematics, pp. 1603–1626, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/15271
DOI: 10.1137/20m1366502

A. Czumaj and P. Davies, “Exploiting spontaneous transmissions for broadcasting and leader election in radio networks,” Journal of the ACM, vol. 68, no. 2. Association for Computing Machinery, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/15267
DOI: 10.1145/3446383
arXiv: 1703.01859

F. Alimisis, A. Orvieto, G. Becigneul, and A. Lucchi, “Momentum improves optimization on Riemannian manifolds,” in Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, San Diego, CA, United States; Virtual, 2021, vol. 130, pp. 1351–1359.
LibreCat: https://research-explorer.ista.ac.at/record/15263
arXiv: 2002.04144

M. Arbel-Raviv, T. A. Brown, and A. Morrison, “Getting to the root of concurrent binary search tree performance,” in Proceedings of the 2018 USENIX Annual Technical Conference, Boston, MA, United States, 2020, pp. 295–306.
LibreCat: https://research-explorer.ista.ac.at/record/7272

D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.
LibreCat: https://research-explorer.ista.ac.at/record/7605
DOI: 10.4230/LIPIcs.OPODIS.2019.15
arXiv: 1911.06347

A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2020, pp. 309–318.
LibreCat: https://research-explorer.ista.ac.at/record/7803
DOI: 10.1145/3382734.3405751
arXiv: 2009.06043

V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in 34th International Symposium on Distributed Computing, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.
LibreCat: https://research-explorer.ista.ac.at/record/8725
DOI: 10.4230/LIPIcs.DISC.2020.3
arXiv: 2008.01009

S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.
LibreCat: https://research-explorer.ista.ac.at/record/9632
arXiv: 2004.14340