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.
168 Publications
2021 |
Published |
Conference Paper |
IST-REx-ID: 15263 |
Momentum improves optimization on Riemannian manifolds
F. Alimisis, A. Orvieto, G. Becigneul, A. Lucchi, in:, Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2021, pp. 1351–1359.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
F. Alimisis, A. Orvieto, G. Becigneul, A. Lucchi, in:, Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2021, pp. 1351–1359.
2021 |
Published |
Journal Article |
IST-REx-ID: 15267 |
Exploiting spontaneous transmissions for broadcasting and leader election in radio networks
A. Czumaj, P. Davies, Journal of the ACM 68 (2021).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
A. Czumaj, P. Davies, Journal of the ACM 68 (2021).
2021 |
Published |
Journal Article |
IST-REx-ID: 15271
Simple, deterministic, constant-round coloring in congested clique and MPC
A. Czumaj, P. Davies, M. Parter, SIAM Journal on Computing 50 (2021) 1603–1626.
View
| DOI
| WoS
A. Czumaj, P. Davies, M. Parter, SIAM Journal on Computing 50 (2021) 1603–1626.
2021 |
Published |
Conference Paper |
IST-REx-ID: 10853 |
A scalable concurrent algorithm for dynamic connectivity
A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–220.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–220.
2021 |
Published |
Conference Paper |
IST-REx-ID: 10854 |
Input-dynamic distributed algorithms for communication networks
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.
2021 |
Published |
Journal Article |
IST-REx-ID: 10855 |
Input-dynamic distributed algorithms for communication networks
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
2021 |
Published |
Conference Paper |
IST-REx-ID: 11436 |
Asynchronous optimization methods for efficient training of deep neural networks with guarantees
V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.
2021 |
Published |
Journal Article |
IST-REx-ID: 10180 |
Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks
T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, A. Krumes, Journal of Machine Learning Research 22 (2021) 1–124.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, A. Krumes, Journal of Machine Learning Research 22 (2021) 1–124.
2021 |
Published |
Conference Paper |
IST-REx-ID: 10216 |
Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds
B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
| arXiv
B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 |
Published |
Conference Paper |
IST-REx-ID: 10217 |
Lower bounds for shared-memory leader election under bounded write contention
D.-A. Alistarh, R. Gelashvili, G. Nadiradze, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
D.-A. Alistarh, R. Gelashvili, G. Nadiradze, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 |
Published |
Conference Paper |
IST-REx-ID: 10218 |
Brief announcement: Fast graphical population protocols
D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
| arXiv
D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 |
Published |
Conference Paper |
IST-REx-ID: 10219 |
Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
| arXiv
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 |
Published |
Journal Article |
IST-REx-ID: 7939 |
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.
2021 |
Published |
Journal Article |
IST-REx-ID: 8723 |
Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging
S. Li, T.B.-N. Tal Ben-Nun, G. Nadiradze, S.D. Girolamo, N. Dryden, D.-A. Alistarh, T. Hoefler, IEEE Transactions on Parallel and Distributed Systems 32 (2021).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
S. Li, T.B.-N. Tal Ben-Nun, G. Nadiradze, S.D. Girolamo, N. Dryden, D.-A. Alistarh, T. Hoefler, IEEE Transactions on Parallel and Distributed Systems 32 (2021).
2021 |
Published |
Journal Article |
IST-REx-ID: 9541 |
Graph sparsification for derandomizing massively parallel computation with low space
A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).
2021 |
Published |
Conference Paper |
IST-REx-ID: 9543 |
New bounds for distributed mean estimation and variance reduction
P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, D.-A. Alistarh, in:, 9th International Conference on Learning Representations, 2021.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, D.-A. Alistarh, in:, 9th International Conference on Learning Representations, 2021.
2021 |
Published |
Journal Article |
IST-REx-ID: 9571 |
NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization
A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 1−43.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 1−43.
2021 |
Published |
Conference Paper |
IST-REx-ID: 9620 |
Collecting coupons is faster with friends
D.-A. Alistarh, P. Davies, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 3–12.
[Preprint]
View
| Files available
| DOI
| WoS
D.-A. Alistarh, P. Davies, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 3–12.
2021 |
Published |
Conference Paper |
IST-REx-ID: 9678 |
Efficient load-balancing through distributed token dropping
S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.
2021 |
Published |
Journal Article |
IST-REx-ID: 9827 |
Concurrent linearizable nearest neighbour search in LockFree-kD-tree
B. Chatterjee, I. Walulya, P. Tsigas, Theoretical Computer Science 886 (2021) 27–48.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
B. Chatterjee, I. Walulya, P. Tsigas, Theoretical Computer Science 886 (2021) 27–48.