3 Publications

Mark all

[3]
2019 | Conference Paper | IST-REx-ID: 6933   OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
View | DOI | Download (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6935   OA
Does preprocessing help under congestion?
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
View | DOI | Download (ext.) | arXiv
 
[1]
2019 | Journal Article | IST-REx-ID: 7150   OA
Algebraic methods in the congested clique
K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478.
View | DOI | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Export / Embed

3 Publications

Mark all

[3]
2019 | Conference Paper | IST-REx-ID: 6933   OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
View | DOI | Download (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6935   OA
Does preprocessing help under congestion?
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
View | DOI | Download (ext.) | arXiv
 
[1]
2019 | Journal Article | IST-REx-ID: 7150   OA
Algebraic methods in the congested clique
K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478.
View | DOI | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Export / Embed