6 Publications

Mark all

[6]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen, J., Paz, A., Rybicki, J., Schmid, S., & Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.58
View | Files available | DOI | arXiv
 
[5]
2020 | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2020). Fast approximate shortest paths in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-020-00380-5
View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation via relaxed scheduling. In Advances in Neural Information Processing Systems (Vol. 33, pp. 22361–22372). Vancouver, Canada: Curran Associates.
View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Conference Paper | IST-REx-ID: 6933 | OA
Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2019). Fast approximate shortest paths in the congested clique. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin (pp. 74–83). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331633
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
Foerster, K.-T., Korhonen, J., Rybicki, J., & Schmid, S. (2019). Does preprocessing help under congestion? In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 259–261). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331581
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Journal Article | IST-REx-ID: 7150 | OA
Censor-Hillel, K., Kaski, P., Korhonen, J., Lenzen, C., Paz, A., & Suomela, J. (2019). Algebraic methods in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-016-0270-2
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

6 Publications

Mark all

[6]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen, J., Paz, A., Rybicki, J., Schmid, S., & Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.58
View | Files available | DOI | arXiv
 
[5]
2020 | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2020). Fast approximate shortest paths in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-020-00380-5
View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation via relaxed scheduling. In Advances in Neural Information Processing Systems (Vol. 33, pp. 22361–22372). Vancouver, Canada: Curran Associates.
View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Conference Paper | IST-REx-ID: 6933 | OA
Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2019). Fast approximate shortest paths in the congested clique. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin (pp. 74–83). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331633
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
Foerster, K.-T., Korhonen, J., Rybicki, J., & Schmid, S. (2019). Does preprocessing help under congestion? In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 259–261). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331581
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Journal Article | IST-REx-ID: 7150 | OA
Censor-Hillel, K., Kaski, P., Korhonen, J., Lenzen, C., Paz, A., & Suomela, J. (2019). Algebraic methods in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-016-0270-2
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications