Czumaj, Artur, et al. “Component Stability in Low-Space Massively Parallel Computation.”10.1145/3465084.3467903__Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 481–491, doi:10.1145/3465084.3467903.
LibreCat: https://research-explorer.ista.ac.at/record/9933
DOI: 10.1145/3465084.3467903
WoS: 000744439800049
arXiv: 2106.01880

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

Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.”10.1109/sp40001.2021.00035__2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.
LibreCat: https://research-explorer.ista.ac.at/record/10049
DOI: 10.1109/sp40001.2021.00035

Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.”10.1145/3410220.3453923__Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.
LibreCat: https://research-explorer.ista.ac.at/record/10854
DOI: 10.1145/3410220.3453923
arXiv: 2005.07637

Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.”10.1145/3447384__Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:10.1145/3447384.
LibreCat: https://research-explorer.ista.ac.at/record/10855
DOI: 10.1145/3447384
arXiv: 2005.07637

Nadiradze, Giorgi. On Achieving Scalability through Relaxation. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10429.
LibreCat: https://research-explorer.ista.ac.at/record/10429
DOI: 10.15479/at:ista:10429

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

Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.”10.1145/3451992__ACM Transactions on Algorithms, vol. 17, no. 2, 16, Association for Computing Machinery, 2021, doi:10.1145/3451992.
LibreCat: https://research-explorer.ista.ac.at/record/9541
DOI: 10.1145/3451992
WoS: 000661311300006
arXiv: 1912.05390

Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.”10.1145/3409964.3461785__Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–39, doi:10.1145/3409964.3461785.
LibreCat: https://research-explorer.ista.ac.at/record/9678
DOI: 10.1145/3409964.3461785
arXiv: 2005.07761

Ramezani-Kebrya, Ali, et al. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research, vol. 22, no. 114, Journal of Machine Learning Research, 2021, p. 143.
LibreCat: https://research-explorer.ista.ac.at/record/9571
arXiv: 1908.06077

Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.”10.1007/s00446-020-00380-5__Distributed Computing, vol. 34, Springer Nature, 2021, pp. 463–87, doi: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, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.”10.1137/20m1366502__SIAM Journal on Computing, vol. 50, no. 5, Society for Industrial &; Applied Mathematics, 2021, pp. 1603–26, doi:10.1137/20m1366502.
LibreCat: https://research-explorer.ista.ac.at/record/15271
DOI: 10.1137/20m1366502

Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.”10.1145/3446383__Journal of the ACM, vol. 68, no. 2, 13, Association for Computing Machinery, 2021, doi:10.1145/3446383.
LibreCat: https://research-explorer.ista.ac.at/record/15267
DOI: 10.1145/3446383
arXiv: 1703.01859

Alimisis, Foivos, et al. “Momentum Improves Optimization on Riemannian Manifolds.” Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, vol. 130, ML Research Press, 2021, pp. 1351–59.
LibreCat: https://research-explorer.ista.ac.at/record/15263
arXiv: 2002.04144

Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.
LibreCat: https://research-explorer.ista.ac.at/record/7272

Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.”10.4230/LIPIcs.OPODIS.2019.15__23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi: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, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.”10.1145/3382734.3405751__Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.
LibreCat: https://research-explorer.ista.ac.at/record/7803
DOI: 10.1145/3382734.3405751
arXiv: 2009.06043

Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.”10.4230/LIPIcs.DISC.2020.3__34th International Symposium on Distributed Computing, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi: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, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.
LibreCat: https://research-explorer.ista.ac.at/record/9632
arXiv: 2004.14340

Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72.
LibreCat: https://research-explorer.ista.ac.at/record/9631
arXiv: 2002.11505