Kurtic, Eldar, et al. “How to Prune Your Language Model: Recovering Accuracy on the ‘Sparsity May Cry’ Benchmark.” Proceedings of Machine Learning Research, vol. 234, ML Research Press, 2024, pp. 542–53.
LibreCat: https://research-explorer.ista.ac.at/record/15011
arXiv: 2312.13547

Koval, Nikita, et al. “Fast and Scalable Channels in Kotlin Coroutines.”10.1145/3572848.3577481__Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2023, pp. 107–18, doi:10.1145/3572848.3577481.
LibreCat: https://research-explorer.ista.ac.at/record/12735
DOI: 10.1145/3572848.3577481
arXiv: 2211.04986

Aksenov, Vitaly, et al. “Unexpected Scaling in Path Copying Trees.”10.1145/3572848.3577512__Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2023, pp. 438–40, doi:10.1145/3572848.3577512.
LibreCat: https://research-explorer.ista.ac.at/record/12736
DOI: 10.1145/3572848.3577512

Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th International Conference on Learning Representations .
LibreCat: https://research-explorer.ista.ac.at/record/13053
arXiv: 2207.14200

Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.”10.1145/3591230__Proceedings of the ACM on Programming Languages, vol. 7, 116, Association for Computing Machinery , 2023, doi:10.1145/3591230.
LibreCat: https://research-explorer.ista.ac.at/record/13179
DOI: 10.1145/3591230

Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.”10.1016/j.tcs.2023.113733__Theoretical Computer Science, vol. 948, no. 2, 113733, Elsevier, 2023, doi:10.1016/j.tcs.2023.113733.
LibreCat: https://research-explorer.ista.ac.at/record/12566
DOI: 10.1016/j.tcs.2023.113733
WoS: 000934262700001

Peste, Elena-Alexandra. Efficiency and Generalization of Sparse Neural Networks. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13074.
LibreCat: https://research-explorer.ista.ac.at/record/13074
DOI: 10.15479/at:ista:13074

Aksenov, Vitalii, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.”10.1007/s00446-022-00441-x__Distributed Computing, vol. 36, Springer Nature, 2023, pp. 395–418, doi:10.1007/s00446-022-00441-x.
LibreCat: https://research-explorer.ista.ac.at/record/12330
DOI: 10.1007/s00446-022-00441-x
WoS: 000913424000001
arXiv: 2008.01009

Markov, Ilia, et al. “Quantized Distributed Training of Large Models with Convergence Guarantees.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 24020–44.
LibreCat: https://research-explorer.ista.ac.at/record/14461
arXiv: 2302.02390

Shevchenko, Aleksandr, et al. “Fundamental Limits of Two-Layer Autoencoders, and Achieving Them with Gradient Methods.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 31151–209.
LibreCat: https://research-explorer.ista.ac.at/record/14459
arXiv: 2212.13468

Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27.
LibreCat: https://research-explorer.ista.ac.at/record/14460
arXiv: 2302.04852

Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10323–37.
LibreCat: https://research-explorer.ista.ac.at/record/14458
arXiv: 2301.00774

Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.”10.1137/20M1375851__SIAM Journal on Computing, vol. 52, no. 4, Society for Industrial and Applied Mathematics, 2023, pp. 913–44, doi:10.1137/20M1375851.
LibreCat: https://research-explorer.ista.ac.at/record/14364
DOI: 10.1137/20M1375851
WoS: 001082972300004
arXiv: 1811.01421

Iofinova, Eugenia B., et al. “Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures.”10.1109/cvpr52729.2023.02334__2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2023, pp. 24364–73, doi:10.1109/cvpr52729.2023.02334.
LibreCat: https://research-explorer.ista.ac.at/record/14771
DOI: 10.1109/cvpr52729.2023.02334
WoS: 001062531308068
arXiv: 2304.12622

Beznosikov, Aleksandr, et al. “On Biased Compression for Distributed Learning.” Journal of Machine Learning Research, vol. 24, Journal of Machine Learning Research, 2023, pp. 1–50.
LibreCat: https://research-explorer.ista.ac.at/record/14815
WoS: 001111578500001
arXiv: 2002.12410

Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.”10.1007/978-3-031-37706-8_8__35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 156–69, doi:10.1007/978-3-031-37706-8_8.
LibreCat: https://research-explorer.ista.ac.at/record/14260
DOI: 10.1007/978-3-031-37706-8_8

Koval, Nikita, et al. Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM. Zenodo, 2023, doi:10.5281/ZENODO.7877757.
LibreCat: https://research-explorer.ista.ac.at/record/14995
DOI: 10.5281/ZENODO.7877757

Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.”10.1145/3558481.3591082__Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–71, doi:10.1145/3558481.3591082.
LibreCat: https://research-explorer.ista.ac.at/record/13262
DOI: 10.1145/3558481.3591082
arXiv: 2304.09331

Safaryan, Mher, et al. “Knowledge Distillation Performs Partial Variance Reduction.” 36th Conference on Neural Information Processing Systems, vol. 36, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/15363
arXiv: 2305.17581

Alistarh, Dan-Adrian, et al. “Fast Graphical Population Protocols.”10.4230/LIPIcs.OPODIS.2021.14__25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas et al., vol. 217, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.OPODIS.2021.14.
LibreCat: https://research-explorer.ista.ac.at/record/11184
DOI: 10.4230/LIPIcs.OPODIS.2021.14
arXiv: 2102.08808