Please note that ISTA Research Explorer 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


2023 | Journal Article | IST-REx-ID: 12566 | OA
Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. Theoretical Computer Science. 2023;948(2). doi:10.1016/j.tcs.2023.113733
[Published Version] View | Files available | DOI | WoS
 

2023 | Thesis | IST-REx-ID: 13074 | OA
Peste E-A. Efficiency and generalization of sparse neural networks. 2023. doi:10.15479/at:ista:13074
[Published Version] View | Files available | DOI
 

2023 | Journal Article | IST-REx-ID: 12330 | OA
Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 2023;36:395-418. doi:10.1007/s00446-022-00441-x
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14461 | OA
Markov I, Vladu A, Guo Q, Alistarh D-A. Quantized distributed training of large models with convergence guarantees. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:24020-24044.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14459 | OA
Shevchenko A, Kögler K, Hassani H, Mondelli M. Fundamental limits of two-layer autoencoders, and achieving them with gradient methods. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:31151-31209.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14460 | OA
Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:26215-26227.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14458 | OA
Frantar E, Alistarh D-A. SparseGPT: Massive language models can be accurately pruned in one-shot. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10323-10337.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 14364 | OA
Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Why extension-based proofs fail. SIAM Journal on Computing. 2023;52(4):913-944. doi:10.1137/20M1375851
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14771 | OA
Iofinova EB, Peste E-A, Alistarh D-A. Bias in pruned vision models: In-depth analysis and countermeasures. In: 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2023:24364-24373. doi:10.1109/cvpr52729.2023.02334
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Journal Article | IST-REx-ID: 14815 | OA
Beznosikov A, Horvath S, Richtarik P, Safaryan M. On biased compression for distributed learning. Journal of Machine Learning Research. 2023;24:1-50.
[Published Version] View | Files available | WoS | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14260 | OA
Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. In: 35th International Conference on Computer Aided Verification . Vol 13964. Springer Nature; 2023:156-169. doi:10.1007/978-3-031-37706-8_8
[Published Version] View | Files available | DOI
 

2023 | Research Data Reference | IST-REx-ID: 14995 | OA
Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. 2023. doi:10.5281/ZENODO.7877757
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2023 | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. Provably-efficient and internally-deterministic parallel Union-Find. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2023:261-271. doi:10.1145/3558481.3591082
[Published Version] View | Files available | DOI | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh D-A, Gelashvili R, Rybicki J. Fast graphical population protocols. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.14
[Published Version] View | Files available | DOI | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11183 | OA
Nikabadi A, Korhonen J. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.15
[Published Version] View | Files available | DOI
 

2022 | Journal Article | IST-REx-ID: 11420 | OA
Shevchenko A, Kungurtsev V, Mondelli M. Mean-field analysis of piecewise linear solutions for wide ReLU networks. Journal of Machine Learning Research. 2022;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. Brief announcement: Temporal locality in online algorithms. In: 36th International Symposium on Distributed Computing. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.DISC.2022.52
[Published Version] View | Files available | DOI
 

2022 | Conference Paper | IST-REx-ID: 12780 | OA
Markov I, Ramezanikebrya H, Alistarh D-A. CGX: Adaptive system support for communication-efficient deep learning. In: Proceedings of the 23rd ACM/IFIP International Middleware Conference. Association for Computing Machinery; 2022:241-254. doi:10.1145/3528535.3565248
[Published Version] View | Files available | DOI | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2022:246-256. doi:10.1145/3519270.3538435
[Published Version] View | Files available | DOI | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11181 | OA
Brown TA, Sigouin W, Alistarh D-A. PathCAS: An efficient middle ground for concurrent search data structures. In: Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2022:385-399. doi:10.1145/3503221.3508410
[Published Version] View | Files available | DOI | WoS
 

Filters and Search Terms

department=DaAl

Search

Filter Publications