Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




141 Publications

2021 | Published | Conference Paper | IST-REx-ID: 9620 | OA
Alistarh D-A, Davies P. 2021. Collecting coupons is faster with friends. Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 12810, 3–12.
[Preprint] View | Files available | DOI
 
2021 | Published | Conference Paper | IST-REx-ID: 9678 | OA
Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures , 129–139.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh D-A, Ellen F, Rybicki J. 2021. Wait-free approximate agreement on graphs. Structural Information and Communication Complexity. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 12810, 87–105.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 9827 | OA
Chatterjee B, Walulya I, Tsigas P. 2021. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. 886, 27–48.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Published | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing. 34, 463–487.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 13147 | OA
Alimisis F, Davies P, Alistarh D-A. 2021. Communication-efficient distributed optimization with quantized preconditioners. Proceedings of the 38th International Conference on Machine Learning. International Conference on Machine Learning vol. 139, 196–206.
[Published Version] View | Files available | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10853 | OA
Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 208–220.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10854 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
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. 5(1), 1–33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 11436 | OA
Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 11452 | OA
Alimisis F, Davies P, Vandereycken B, Alistarh D-A. 2021. Distributed principal component analysis with limited communication. Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 4, 2823–2834.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 11458 | OA
Krumes A, Iofinova EB, Vladu A, Alistarh D-A. 2021. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 8557–8570.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 11463 | OA
Frantar E, Kurtic E, Alistarh D-A. 2021. M-FAC: Efficient matrix-free approximations of second-order information. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 14873–14886.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 11464 | OA
Alistarh D-A, Korhonen J. 2021. Towards tight communication lower bounds for distributed optimisation. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 7254–7266.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 15263 | OA
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.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 15267 | OA
Czumaj A, Davies P. 2021. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM. 68(2), 13.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 15271
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.
View | DOI
 
2020 | Published | Conference Paper | IST-REx-ID: 8722 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 8724 | OA
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.
[Published Version] View | Files available | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 8725 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed