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.
148 Publications
2021 | Published | Conference Paper | IST-REx-ID: 9823 | 
Wait-free approximate agreement on graphs
D.-A. Alistarh, F. Ellen, J. Rybicki, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 87–105.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
D.-A. Alistarh, F. Ellen, J. Rybicki, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 87–105.
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.
2021 | Published | Conference Paper | IST-REx-ID: 9951
Comparison dynamics in population protocols
D.-A. Alistarh, M. Töpfer, P. Uznański, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 55–65.
View
| DOI
| WoS
D.-A. Alistarh, M. Töpfer, P. Uznański, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 55–65.
2021 | Published | Conference Paper | IST-REx-ID: 10216 |
Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds
Chatterjee, Bapi, Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing 209. 2021
[Published Version]
View
| Files available
| DOI
| arXiv
Chatterjee, Bapi, Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing 209. 2021
2021 | Published | Journal Article | IST-REx-ID: 9571 |
NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization
Ramezani-Kebrya, Ali, NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research 22 (114). 2021
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
Ramezani-Kebrya, Ali, NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research 22 (114). 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: 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 | Conference Paper | IST-REx-ID: 10219 |
Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
Korhonen, Janne, Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing 209. 2021
[Published Version]
View
| Files available
| DOI
| arXiv
Korhonen, Janne, Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing 209. 2021
2021 | Published | Conference Paper | IST-REx-ID: 11463 |
M-FAC: Efficient matrix-free approximations of second-order information
Frantar, Elias, M-FAC: Efficient matrix-free approximations of second-order information. 35th Conference on Neural Information Processing Systems 34. 2021
[Published Version]
View
| Download Published Version (ext.)
| arXiv
Frantar, Elias, M-FAC: Efficient matrix-free approximations of second-order information. 35th Conference on Neural Information Processing Systems 34. 2021
2021 | Published | Conference Paper | IST-REx-ID: 10217 |
Lower bounds for shared-memory leader election under bounded write contention
Alistarh, Dan-Adrian, Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing 209. 2021
[Published Version]
View
| Files available
| DOI
Alistarh, Dan-Adrian, Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing 209. 2021
2021 | Published | Conference Paper | IST-REx-ID: 11464 |
Towards tight communication lower bounds for distributed optimisation
Alistarh, Dan-Adrian, Towards tight communication lower bounds for distributed optimisation. 35th Conference on Neural Information Processing Systems 34. 2021
[Published Version]
View
| Download Published Version (ext.)
| arXiv
Alistarh, Dan-Adrian, Towards tight communication lower bounds for distributed optimisation. 35th Conference on Neural Information Processing Systems 34. 2021
2021 | Published | Journal Article | IST-REx-ID: 8723 |
Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging
Li, Shigang, Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems 32 (7). 2021
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Li, Shigang, Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems 32 (7). 2021
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 | 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: 15271
Simple, deterministic, constant-round coloring in congested clique and MPC
Czumaj, Artur, Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing 50 (5). 2021
View
| DOI
Czumaj, Artur, Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing 50 (5). 2021
2021 | Published | Conference Paper | IST-REx-ID: 9620 |
Collecting coupons is faster with friends
Alistarh, Dan-Adrian, Collecting coupons is faster with friends. Structural Information and Communication Complexity 12810. 2021
[Preprint]
View
| Files available
| DOI
Alistarh, Dan-Adrian, Collecting coupons is faster with friends. Structural Information and Communication Complexity 12810. 2021
2021 | Published | Conference Paper | IST-REx-ID: 9543 |
New bounds for distributed mean estimation and variance reduction
Davies, Peter, New bounds for distributed mean estimation and variance reduction. 9th International Conference on Learning Representations. 2021
[Published Version]
View
| Download Published Version (ext.)
| arXiv
Davies, Peter, New bounds for distributed mean estimation and variance reduction. 9th International Conference on Learning Representations. 2021
2021 | Published | Conference Paper | IST-REx-ID: 9933 |
Component stability in low-space massively parallel computation
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 481–491.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 481–491.
2021 | Published | Conference Paper | IST-REx-ID: 9935 |
Improved deterministic (Δ+1) coloring in low-space MPC
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 469–479.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 469–479.