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.
118 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.