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.
121 Publications
2021 | Conference Paper | IST-REx-ID: 10049 | 
Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
2021 | 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 | 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 | Thesis | IST-REx-ID: 10429 |
On achieving scalability through relaxation
G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.
2021 | Conference Paper | IST-REx-ID: 10435 |
Asynchronous decentralized SGD with quantized and local updates
G. Nadiradze, A. Sabour, P. Davies, S. Li, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
G. Nadiradze, A. Sabour, P. Davies, S. Li, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.
2021 | 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 | 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 | Journal Article | IST-REx-ID: 8286 |
Dynamic averaging load balancing on cycles
D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica (2021).
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica (2021).
2021 | 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 | 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 | 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
A. Czumaj, P. Davies, M. Parter, SIAM Journal on Computing 50 (2021) 1603–1626.
2021 | 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 | 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.
2020 | Conference Paper | IST-REx-ID: 7272 |
Getting to the root of concurrent binary search tree performance
M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.
[Published Version]
View
| Download Published Version (ext.)
M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.
2020 | Conference Paper | IST-REx-ID: 7605 |
In search of the fastest concurrent union-find algorithm
D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16.
[Published Version]
View
| Files available
| DOI
| arXiv
D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16.
2020 | Conference Paper | IST-REx-ID: 7803 |
Simple, deterministic, constant-round coloring in the congested clique
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318.
[Submitted Version]
View
| Files available
| DOI
| arXiv
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318.
2020 | Conference Paper | IST-REx-ID: 8725 |
The splay-list: A distribution-adaptive concurrent skip-list
V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.
[Published Version]
View
| Files available
| DOI
| arXiv
V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.
2020 | Conference Paper | IST-REx-ID: 9632 |
WoodFisher: Efficient second-order approximation for neural network compression
S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109.
2020 | Conference Paper | IST-REx-ID: 9631 |
Scalable belief propagation via relaxed scheduling
V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372.
2020 | Conference Paper | IST-REx-ID: 9415 |
Inducing and exploiting activation sparsity for fast neural network inference
M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543.
[Published Version]
View
| Files available
M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543.