Janne Korhonen
Alistarh Group
10 Publications
2022 | Conference Paper | IST-REx-ID: 11183 | 
Nikabadi, A., & Korhonen, J. (2022). Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.15
[Published Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10219 |
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
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 11464 |
Alistarh, D.-A., & Korhonen, J. (2021). Towards tight communication lower bounds for distributed optimisation. In 35th Conference on Neural Information Processing Systems (Vol. 34, pp. 7254–7266). Virtual, Online: Curran Associates.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 10854 |
Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association for Computing Machinery. https://doi.org/10.1145/3410220.3453923
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 10855 |
Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery. https://doi.org/10.1145/3447384
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 7939 |
Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-020-00380-5
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2020 | Conference Paper | IST-REx-ID: 9631 |
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.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 7150 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 6935 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 6933 |
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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
10 Publications
2022 | Conference Paper | IST-REx-ID: 11183 |
Nikabadi, A., & Korhonen, J. (2022). Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.15
[Published Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10219 |
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
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 11464 |
Alistarh, D.-A., & Korhonen, J. (2021). Towards tight communication lower bounds for distributed optimisation. In 35th Conference on Neural Information Processing Systems (Vol. 34, pp. 7254–7266). Virtual, Online: Curran Associates.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 10854 |
Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association for Computing Machinery. https://doi.org/10.1145/3410220.3453923
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 10855 |
Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery. https://doi.org/10.1145/3447384
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 7939 |
Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-020-00380-5
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2020 | Conference Paper | IST-REx-ID: 9631 |
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.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 7150 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 6935 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 6933 |
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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv