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.
117 Publications
2024 | Conference Paper | IST-REx-ID: 15011 |
Kurtic E, Hoefler T, Alistarh D-A. How to prune your language model: Recovering accuracy on the “Sparsity May Cry” benchmark. In: Proceedings of Machine Learning Research. Vol 234. ML Research Press; 2024:542-553.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 12735 |
Koval N, Alistarh D-A, Elizarov R. Fast and scalable channels in Kotlin Coroutines. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2023:107-118. doi:10.1145/3572848.3577481
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Poster | IST-REx-ID: 12736 |
Aksenov V, Brown TA, Fedorov A, Kokorin I. Unexpected Scaling in Path Copying Trees. Association for Computing Machinery; 2023:438-440. doi:10.1145/3572848.3577512
[Published Version]
View
| DOI
| Download Published Version (ext.)
2023 | Conference Paper | IST-REx-ID: 13053 |
Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. In: 11th International Conference on Learning Representations .
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 13179 |
Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 2023;7. doi:10.1145/3591230
[Published Version]
View
| Files available
| DOI
2023 | Conference Paper | IST-REx-ID: 13262 |
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
2023 | Journal Article | IST-REx-ID: 12566 |
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 |
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 |
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 |
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