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.




121 Publications

2022 | Journal Article | IST-REx-ID: 11420 | OA
Shevchenko A, Kungurtsev V, Mondelli M. 2022. Mean-field analysis of piecewise linear solutions for wide ReLU networks. Journal of Machine Learning Research. 23(130), 1–55.
[Published Version] View | Files available | arXiv
 
2022 | Conference Paper | IST-REx-ID: 12182 | OA
Pacut M, Parham M, Rybicki J, Schmid S, Suomela J, Tereshchenko A. 2022. Brief announcement: Temporal locality in online algorithms. 36th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing vol. 246, 52.
[Published Version] View | Files available | DOI
 
2022 | Conference Paper | IST-REx-ID: 12780 | OA
Markov I, Ramezanikebrya H, Alistarh D-A. 2022. CGX: Adaptive system support for communication-efficient deep learning. Proceedings of the 23rd ACM/IFIP International Middleware Conference. Middleware: International Middleware Conference, 241–254.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election in population protocols on graphs. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 246–256.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Conference Paper | IST-REx-ID: 11181 | OA
Brown TA, Sigouin W, Alistarh D-A. 2022. PathCAS: An efficient middle ground for concurrent search data structures. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 385–399.
[Published Version] View | Files available | DOI | WoS
 
2022 | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. 2022. Multi-queues can be state-of-the-art priority schedulers. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 353–367.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova A, Koval N, Nadiradze G, Alistarh D-A. 2022. Multi-queues can be state-of-the-art priority schedulers, Zenodo, 10.5281/ZENODO.5733408.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2022 | Conference Paper | IST-REx-ID: 11707 | OA
Balliu A, Hirvonen J, Melnyk D, Olivetti D, Rybicki J, Suomela J. 2022. Local mending. International Colloquium on Structural Information and Communication Complexity. SIROCCO: Structural Information and Communication ComplexityLNCS vol. 13298, 1–20.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Conference Paper | IST-REx-ID: 12299 | OA
Iofinova EB, Peste E-A, Kurtz M, Alistarh D-A. 2022. How well do sparse ImageNet models transfer? 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Computer Vision and Pattern Recognition, 12256–12266.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Journal Article | IST-REx-ID: 10180 | OA
Hoefler T, Alistarh D-A, Ben-Nun T, Dryden N, Peste E-A. 2021. Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. Journal of Machine Learning Research. 22(241), 1–124.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10218 | OA
Alistarh D-A, Gelashvili R, Rybicki J. 2021. Brief announcement: Fast graphical population protocols. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 43.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh D-A, Gelashvili R, Nadiradze G. 2021. Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 4.
[Published Version] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee B, Peri S, Sa M. 2021. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 52.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. 2021. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 58.
[Published Version] View | Files available | DOI | arXiv
 
2021 | 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 | 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 | 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 | 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 | 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 | Conference Paper | IST-REx-ID: 9543 | OA
Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. 2021. New bounds for distributed mean estimation and variance reduction. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | 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 | 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 | Conference Paper | IST-REx-ID: 11458 | OA
Peste E-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 | 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 | Journal Article | IST-REx-ID: 8723 | OA
Li S, Tal Ben-Nun TB-N, Nadiradze G, Girolamo SD, Dryden N, Alistarh D-A, Hoefler T. 2021. Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems. 32(7), 9271898.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | 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 | Conference Paper | IST-REx-ID: 9951
Alistarh D-A, Töpfer M, Uznański P. 2021. Comparison dynamics in population protocols. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 55–65.
View | DOI | WoS
 
2021 | Conference Paper | IST-REx-ID: 9935 | OA
Czumaj A, Davies P, Parter M. 2021. Improved deterministic (Δ+1) coloring in low-space MPC. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 469–479.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 9933 | OA
Czumaj A, Davies P, Parter M. 2021. Component stability in low-space massively parallel computation. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 481–491.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2021 | 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 | 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 | Thesis | IST-REx-ID: 10429 | OA
Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. 2021. Asynchronous decentralized SGD with quantized and local updates. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Journal Article | IST-REx-ID: 9541 | OA
Czumaj A, Davies P, Parter M. 2021. Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. 17(2), 16.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | 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 | Journal Article | IST-REx-ID: 8286 | OA
Alistarh D-A, Nadiradze G, Sabour A. 2021. Dynamic averaging load balancing on cycles. Algorithmica.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2021 | Journal Article | IST-REx-ID: 9571 | OA
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), 1−43.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | 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 | 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
 
2021 | 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 | 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
 
2020 | Conference Paper | IST-REx-ID: 7272 | OA
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.
[Published Version] View | Download Published Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 7605 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7803 | OA
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.
[Submitted Version] View | Files available | DOI | arXiv
 
2020 | 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
 
2020 | Conference Paper | IST-REx-ID: 9632 | OA
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.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 9631 | OA
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.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 9415 | OA
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.
[Published Version] View | Files available
 

Search

Filter Publications