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.

Ionut-Vlad Modoranu

Alexander Fedorov

Mahdi Nikdan

Eldar Kurtic

Dan Alistarh

Jiale Chen

Mher Safaryan

Eugenia Iofinova

Sokolova, Mariia

Vitalii Aksenov

Elias Frantar

Peter Davies

Joel Rybicki

Trevor Brown

Giorgi Nadiradze

Alexandra Krumes

Bapi Chatterjee

Martin Töpfer

Sharareh Alipour

Elvir Crncevic

Janne Korhonen

Ilia Markov

Sidak Singh



117 Publications

2022 | Published | Conference Paper | IST-REx-ID: 12780 | OA
I. Markov, H. Ramezanikebrya, and D.-A. Alistarh, “CGX: Adaptive system support for communication-efficient deep learning,” in Proceedings of the 23rd ACM/IFIP International Middleware Conference, Quebec, QC, Canada, 2022, pp. 241–254.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
A. Postnikova, N. Koval, G. Nadiradze, and D.-A. Alistarh, “Multi-queues can be state-of-the-art priority schedulers.” Zenodo, 2022.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2022 | Published | Conference Paper | IST-REx-ID: 11180 | OA
A. Postnikova, N. Koval, G. Nadiradze, and D.-A. Alistarh, “Multi-queues can be state-of-the-art priority schedulers,” in Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, 2022, pp. 353–367.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 11181 | OA
T. A. Brown, W. Sigouin, and D.-A. Alistarh, “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, Seoul, Republic of Korea, 2022, pp. 385–399.
[Published Version] View | Files available | DOI | WoS
 
2022 | Published | Conference Paper | IST-REx-ID: 11183 | OA
A. Nikabadi and J. Korhonen, “Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.
[Published Version] View | Files available | DOI
 
2022 | Published | Conference Paper | IST-REx-ID: 11184 | OA
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Fast graphical population protocols,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 11420 | OA
A. Shevchenko, V. Kungurtsev, and M. Mondelli, “Mean-field analysis of piecewise linear solutions for wide ReLU networks,” Journal of Machine Learning Research, vol. 23, no. 130. Journal of Machine Learning Research, pp. 1–55, 2022.
[Published Version] View | Files available | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 11707 | OA
A. Balliu, J. Hirvonen, D. Melnyk, D. Olivetti, J. Rybicki, and J. Suomela, “Local mending,” in International Colloquium on Structural Information and Communication Complexity, Paderborn, Germany, 2022, vol. 13298, pp. 1–20.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 11844 | OA
D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2022, pp. 246–256.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 13147 | OA
F. Alimisis, P. Davies, and D.-A. Alistarh, “Communication-efficient distributed optimization with quantized preconditioners,” in Proceedings of the 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 196–206.
[Published Version] View | Files available | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 8286 | OA
D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” Algorithmica. Springer Nature, 2021.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 8723 | OA
S. Li et al., “Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging,” IEEE Transactions on Parallel and Distributed Systems, vol. 32, no. 7. IEEE, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 7939 | OA
K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” Distributed Computing, vol. 34. Springer Nature, pp. 463–487, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10049 | OA
K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in 2021 IEEE Symposium on Security and Privacy , San Francisco, CA, United States, 2021, pp. 268–284.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2021 | Published | Journal Article | IST-REx-ID: 10180 | OA
T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, and E.-A. Peste, “Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks,” Journal of Machine Learning Research, vol. 22, no. 241. Journal of Machine Learning Research, pp. 1–124, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10216 | OA
B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10217 | OA
D.-A. Alistarh, R. Gelashvili, and G. Nadiradze, “Lower bounds for shared-memory leader election under bounded write contention,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI
 
2021 | Published | Conference Paper | IST-REx-ID: 10218 | OA
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast graphical population protocols,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Published | Thesis | PhD | IST-REx-ID: 10429 | OA
G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed