Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. 2021. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 22(114), 143.
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. 34, 463–487.
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. 50(5), 1603–1626.
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. 68(2), 13.
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. Proceedings of the 24th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 130, 1351–1359.
LibreCat: https://research-explorer.ista.ac.at/record/15263
arXiv: 2002.04144

Arbel-Raviv M, Brown TA, Morrison A. 2020. Getting to the root of concurrent binary search tree performance. Proceedings of the 2018 USENIX Annual Technical Conference. USENIX: Annual Technical Conference, 295–306.
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. 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 15:1-15:16.
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. Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 309–318.
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. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.
LibreCat: https://research-explorer.ista.ac.at/record/8725
DOI: 10.4230/LIPIcs.DISC.2020.3
arXiv: 2008.01009

Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 18098–18109.
LibreCat: https://research-explorer.ista.ac.at/record/9632
arXiv: 2004.14340

Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via relaxed scheduling. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 22361–22372.
LibreCat: https://research-explorer.ista.ac.at/record/9631
arXiv: 2002.11505

Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119, 5533–5543.
LibreCat: https://research-explorer.ista.ac.at/record/9415

Gurel NM, Kara K, Stojanov A, Smith T, Lemmin T, Alistarh D-A, Puschel M, Zhang C. 2020. Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications. IEEE Transactions on Signal Processing. 68, 4268–4282.
LibreCat: https://research-explorer.ista.ac.at/record/8268
DOI: 10.1109/TSP.2020.3010355
WoS: 000562044500001
arXiv: 1802.04907

Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. 2020. Taming unbalanced training workloads in deep learning with partial collective operations. Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 45–61.
LibreCat: https://research-explorer.ista.ac.at/record/8722
DOI: 10.1145/3332466.3374528
WoS: 000564476500004
arXiv: 1908.04207

Rybicki J, Abrego N, Ovaskainen O. 2020. Habitat fragmentation and species diversity in competitive communities. Ecology Letters. 23(3), 506–517.
LibreCat: https://research-explorer.ista.ac.at/record/7224
DOI: 10.1111/ele.13450
WoS: 000503625200001

Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. 2020. On the sample complexity of adversarial multi-source PAC learning. Proceedings of the 37th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 119, 5416–5425.
LibreCat: https://research-explorer.ista.ac.at/record/8724
arXiv: 2002.10384

Bhatia S, Chatterjee B, Nathani D, Kaul M. 2020. A persistent homology perspective to the link prediction problem. Complex Networks and their applications VIII. COMPLEX: International Conference on Complex Networks and their Applications, SCI, vol. 881, 27–39.
LibreCat: https://research-explorer.ista.ac.at/record/7213
DOI: 10.1007/978-3-030-36687-2_3
WoS: 000843927300003

Czumaj A, Davies P, Parter M. 2020. Graph sparsification for derandomizing massively parallel computation with low space. Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). SPAA: Symposium on Parallelism in Algorithms and Architectures, 175–185.
LibreCat: https://research-explorer.ista.ac.at/record/7802
DOI: 10.1145/3350755.3400282
WoS: 000744436200015
arXiv: 1912.05390

Brown TA, Prokopec A, Alistarh D-A. 2020. Non-blocking interpolation search trees with doubly-logarithmic running time. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPOPP: Principles and Practice of Parallel Programming, 276–291.
LibreCat: https://research-explorer.ista.ac.at/record/7636
DOI: 10.1145/3332466.3374542
WoS: 000564476500020

Alistarh D-A, Brown TA, Singhal N. 2020. Memory tagging: Minimalist synchronization for scalable concurrent data structures. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 37–49.
LibreCat: https://research-explorer.ista.ac.at/record/8191
DOI: 10.1145/3350755.3400213
WoS: 000744436200004