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.

Soroush Tabesh

Eldar Kurtic

Vage Egiazarian

Erik Schultheis

Andrei Panferov

Mahdi Nikdan

Jiale Chen

Dan Alistarh

Ionut-Vlad Modoranu

Sergei Pankratov

Alexandra Volkova

Joel Rybicki

Janne Korhonen

Sharareh Alipour

Giorgi Nadiradze

Vitalii Aksenov

Mher Safaryan

Sidak Singh

Alexander Fedorov

Alexandra Krumes

Roberto Lopez Castro

Ilia Markov

Bapi Chatterjee

Elvir Crncevic

Peter Davies

Martin Töpfer

Elias Frantar

Trevor Brown

Sokolova, Mariia



168 Publications

2021 | Published | Conference Paper | IST-REx-ID: 15263 | OA
F. Alimisis, A. Orvieto, G. Becigneul, and A. Lucchi, “Momentum improves optimization on Riemannian manifolds,” in Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, San Diego, CA, United States; Virtual, 2021, vol. 130, pp. 1351–1359.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 15267 | OA
A. Czumaj and P. Davies, “Exploiting spontaneous transmissions for broadcasting and leader election in radio networks,” Journal of the ACM, vol. 68, no. 2. Association for Computing Machinery, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 15271
A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in congested clique and MPC,” SIAM Journal on Computing, vol. 50, no. 5. Society for Industrial and Applied Mathematics, pp. 1603–1626, 2021.
View | DOI | WoS
 
2021 | Published | Conference Paper | IST-REx-ID: 10853 | OA
A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm for dynamic connectivity,” in Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual, Online, 2021, pp. 208–220.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10854 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual, Online, 2021, pp. 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 11436 | OA
V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in 35th AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 10180 | OA
T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, and A. Krumes, “Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks,” Journal of Machine Learning Research, vol. 22, no. 241. ML Research Press, 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 | 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 | 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: 9541 | OA
A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” ACM Transactions on Algorithms, vol. 17, no. 2. Association for Computing Machinery, 2021.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9543 | OA
P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, and D.-A. Alistarh, “New bounds for distributed mean estimation and variance reduction,” in 9th International Conference on Learning Representations, Virtual, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 9571 | OA
A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, and D. M. Roy, “NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization,” Journal of Machine Learning Research, vol. 22, no. 114. Journal of Machine Learning Research, p. 1−43, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9620 | OA
D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 3–12.
[Preprint] View | Files available | DOI | WoS
 
2021 | Published | Conference Paper | IST-REx-ID: 9678 | OA
S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2021, pp. 129–139.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 9827 | OA
B. Chatterjee, I. Walulya, and P. Tsigas, “Concurrent linearizable nearest neighbour search in LockFree-kD-tree,” Theoretical Computer Science, vol. 886. Elsevier, pp. 27–48, 2021.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed