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.

Dan Alistarh

Jiale Chen

Vage Egiazarian

Eldar Kurtic

Ionut-Vlad Modoranu

Mahdi Nikdan

Andrei Panferov

Sergei Pankratov

Ileana Rugina

Erik Schultheis

Soroush Tabesh

Alexandra Volkova

Filipp Zmushko

Sharareh Alipour

Vitalii Aksenov

Trevor Brown

Bapi Chatterjee

Elvir Crncevic

Peter Davies

Alexander Fedorov

Elias Frantar

Janne Korhonen

Roberto Lopez Castro

Ilia Markov

Giorgi Nadiradze

Alexandra Krumes

Joel Rybicki

Mher Safaryan

Sidak Singh

Martin Töpfer

Sokolova, Mariia



174 Publications

2021 | Published | Conference Paper | IST-REx-ID: 9543 | OA
Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. New bounds for distributed mean estimation and variance reduction. In: 9th International Conference on Learning Representations. ; 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 9571 | OA
Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 2021;22(114):1−43.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9620 | OA
Alistarh D-A, Davies P. Collecting coupons is faster with friends. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:3-12. doi:10.1007/978-3-030-79527-6_1
[Preprint] View | Files available | DOI | WoS
 
2021 | Published | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:87-105. doi:10.1007/978-3-030-79527-6_6
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 9827 | OA
Chatterjee B, Walulya I, Tsigas P. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. 2021;886:27-48. doi:10.1016/j.tcs.2021.06.041
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Published | Conference Paper | IST-REx-ID: 9933 | OA
Czumaj A, Davies P, Parter M. Component stability in low-space massively parallel computation. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2021:481–491. doi:10.1145/3465084.3467903
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9935 | OA
Czumaj A, Davies P, Parter M. Improved deterministic (Δ+1) coloring in low-space MPC. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2021:469–479. doi:10.1145/3465084.3467937
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Published | Conference Paper | IST-REx-ID: 9951
Alistarh D-A, Töpfer M, Uznański P. Comparison dynamics in population protocols. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2021:55-65. doi:10.1145/3465084.3467915
View | DOI | WoS
 
2021 | Published | Conference Paper | IST-REx-ID: 9678 | OA
Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2021:129-139. doi:10.1145/3409964.3461785
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 11452 | OA
Alimisis F, Davies P, Vandereycken B, Alistarh D-A. Distributed principal component analysis with limited communication. In: 35th Conference on Neural Information Processing Systems. Vol 4. Neural Information Processing Systems Foundation; 2021:2823-2834.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 15267 | OA
Czumaj A, Davies P. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM. 2021;68(2). doi:10.1145/3446383
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 11436 | OA
Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: 35th AAAI Conference on Artificial Intelligence, AAAI 2021. Vol 35. AAAI Press; 2021:8209-8216. doi:10.1609/aaai.v35i9.16999
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Thesis | PhD | IST-REx-ID: 10429 | OA
Nadiradze G. On achieving scalability through relaxation. 2021. doi:10.15479/at:ista:10429
[Published Version] View | Files available | DOI
 
2021 | Published | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045. doi:10.1609/aaai.v35i10.17092
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10049 | OA
Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
earlier version | 2020 | Published | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: 47th International Colloquium on Automata, Languages, and Programming. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7
[Published Version] View | Files available | DOI | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 15086 | OA
Faghri F, Tabrizian I, Markov I, Alistarh D-A, Roy D, Ramezani-Kebrya A. Adaptive gradient quantization for data-parallel SGD. In: Advances in Neural Information Processing Systems. Vol 33. Neural Information Processing Systems Foundation; 2020.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15
[Published Version] View | Files available | DOI | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 7635 | OA
Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2020:423-424. doi:10.1145/3332466.3374503
[Published Version] View | DOI | Download Published Version (ext.)
 
earlier version | 2020 | Published | Conference Paper | IST-REx-ID: 7802 | OA
Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). Association for Computing Machinery; 2020:175-185. doi:10.1145/3350755.3400282
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed