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

Sharareh Alipour

Martin Töpfer

Elvir Crncevic

Janne Korhonen

Ilia Markov

Sidak Singh



117 Publications

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: 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
 
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 | 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
 
2021 | Published | Conference Paper | IST-REx-ID: 10432 | OA
G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10435 | OA
G. Nadiradze, A. Sabour, P. Davies, S. Li, and D.-A. Alistarh, “Asynchronous decentralized SGD with quantized and local updates,” in 35th Conference on Neural Information Processing Systems, Sydney, Australia, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9823 | OA
D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 87–105.
[Preprint] View | 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
 
2021 | Published | Conference Paper | IST-REx-ID: 9933 | OA
A. Czumaj, P. Davies, and M. Parter, “Component stability in low-space massively parallel computation,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual, Italy, 2021, pp. 481–491.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9935 | OA
A. Czumaj, P. Davies, and M. Parter, “Improved deterministic (Δ+1) coloring in low-space MPC,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual, Italy, 2021, pp. 469–479.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Published | Conference Paper | IST-REx-ID: 9951
D.-A. Alistarh, M. Töpfer, and P. Uznański, “Comparison dynamics in population protocols,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual, Italy, 2021, pp. 55–65.
View | DOI | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed