Czumaj, A., Davies, P., &; Parter, M. (2021). Improved deterministic (+1) coloring in low-space MPC. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (pp. 469–479). Virtual, Italy: Association for Computing Machinery.https://doi.org/10.1145/3465084.3467937 
LibreCat: https://research-explorer.ista.ac.at/record/9935
DOI: 10.1145/3465084.3467937
WoS: 000744439800048

Czumaj, A., Davies, P., &; Parter, M. (2021). Component stability in low-space massively parallel computation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (pp. 481–491). Virtual, Italy: Association for Computing Machinery.https://doi.org/10.1145/3465084.3467903 
LibreCat: https://research-explorer.ista.ac.at/record/9933
DOI: 10.1145/3465084.3467903
WoS: 000744439800049
arXiv: 2106.01880

Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., &; Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 9037–9045). Virtual.
LibreCat: https://research-explorer.ista.ac.at/record/10432
arXiv: 2001.05918

Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M.,https://doi.org/10.1109/sp40001.2021.00035__Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In 2021 IEEE Symposium on Security and Privacy  (pp. 268–284). San Francisco, CA, United States: IEEE.https://doi.org/10.1109/sp40001.2021.00035 
LibreCat: https://research-explorer.ista.ac.at/record/10049
DOI: 10.1109/sp40001.2021.00035

Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association for Computing Machinery.https://doi.org/10.1145/3410220.3453923 
LibreCat: https://research-explorer.ista.ac.at/record/10854
DOI: 10.1145/3410220.3453923
arXiv: 2005.07637

Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery.https://doi.org/10.1145/3447384 
LibreCat: https://research-explorer.ista.ac.at/record/10855
DOI: 10.1145/3447384
arXiv: 2005.07637

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

Nadiradze, G., Sabour, A., Davies, P., Li, S., &; Alistarh, D.-A. (2021). Asynchronous decentralized SGD with quantized and local updates. In 35th Conference on Neural Information Processing Systems. Sydney, Australia: Neural Information Processing Systems Foundation.
LibreCat: https://research-explorer.ista.ac.at/record/10435
arXiv: 1910.12308

Czumaj, A., Davies, P., &; Parter, M. (2021). Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. Association for Computing Machinery.https://doi.org/10.1145/3451992 
LibreCat: https://research-explorer.ista.ac.at/record/9541
DOI: 10.1145/3451992
WoS: 000661311300006
arXiv: 1912.05390

Brandt, S., Keller, B., Rybicki, J., Suomela, J., &; Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 129–139).https://doi.org/10.1145/3409964.3461785__Virtual Event, United States.https://doi.org/10.1145/3409964.3461785 
LibreCat: https://research-explorer.ista.ac.at/record/9678
DOI: 10.1145/3409964.3461785
arXiv: 2005.07761

Ramezani-Kebrya, A., Faghri, F., Markov, I., Aksenov, V., Alistarh, D.-A., &; Roy, D. M. (2021). NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. Journal of Machine Learning Research.
LibreCat: https://research-explorer.ista.ac.at/record/9571
arXiv: 1908.06077

Censor-Hillel, K., Dory, M., Korhonen, J., &; Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. Distributed Computing. Springer Nature.https://doi.org/10.1007/s00446-020-00380-5 
LibreCat: https://research-explorer.ista.ac.at/record/7939
DOI: 10.1007/s00446-020-00380-5
WoS: 000556444600001
arXiv: 1903.05956

Czumaj, A., Davies, P., &; Parter, M. (2021). Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/20m1366502 
LibreCat: https://research-explorer.ista.ac.at/record/15271
DOI: 10.1137/20m1366502

Czumaj, A., &; Davies, P. (2021). Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM. Association for Computing Machinery.https://doi.org/10.1145/3446383 
LibreCat: https://research-explorer.ista.ac.at/record/15267
DOI: 10.1145/3446383
arXiv: 1703.01859

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

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

Alistarh, D.-A., Fedorov, A., &; Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2019.15 
LibreCat: https://research-explorer.ista.ac.at/record/7605
DOI: 10.4230/LIPIcs.OPODIS.2019.15
arXiv: 1911.06347

Czumaj, A., Davies, P., &; Parter, M. (2020). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association for Computing Machinery.https://doi.org/10.1145/3382734.3405751 
LibreCat: https://research-explorer.ista.ac.at/record/7803
DOI: 10.1145/3382734.3405751
arXiv: 2009.06043

Aksenov, V., Alistarh, D.-A., Drozdova, A., &; Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In 34th International Symposium on Distributed Computing (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2020.3 
LibreCat: https://research-explorer.ista.ac.at/record/8725
DOI: 10.4230/LIPIcs.DISC.2020.3
arXiv: 2008.01009

Singh, S. P., &; Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.
LibreCat: https://research-explorer.ista.ac.at/record/9632
arXiv: 2004.14340