6 Publications

Mark all

[6]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
View | Files available | DOI | arXiv
 
[5]
2020 | Journal Article | IST-REx-ID: 7939 | OA
K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” Distributed Computing. Springer Nature, 2020.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation via relaxed scheduling,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 22361–22372.
View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Conference Paper | IST-REx-ID: 6933 | OA
K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, Toronto, ON, Canada, 2019, pp. 74–83.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Journal Article | IST-REx-ID: 7150 | OA
K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic methods in the congested clique,” Distributed Computing, vol. 32, no. 6. Springer Nature, pp. 461–478, 2019.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

6 Publications

Mark all

[6]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
View | Files available | DOI | arXiv
 
[5]
2020 | Journal Article | IST-REx-ID: 7939 | OA
K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” Distributed Computing. Springer Nature, 2020.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation via relaxed scheduling,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 22361–22372.
View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Conference Paper | IST-REx-ID: 6933 | OA
K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, Toronto, ON, Canada, 2019, pp. 74–83.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Journal Article | IST-REx-ID: 7150 | OA
K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic methods in the congested clique,” Distributed Computing, vol. 32, no. 6. Springer Nature, pp. 461–478, 2019.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications