Janne Korhonen

Alistarh Group

10 Publications

Mark all

[10]
2022 | Published | Conference Paper | IST-REx-ID: 11183 | OA
A. Nikabadi and J. Korhonen, “Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.
[Published Version] View | Files available | DOI
 
[9]
2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
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
 
[8]
2021 | Published | Conference Paper | IST-REx-ID: 11464 | OA
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
 
[7]
2021 | Published | Conference Paper | IST-REx-ID: 10854 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual, Online, 2021, pp. 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2021 | Published | 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, vol. 34. Springer Nature, pp. 463–487, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[4]
2020 | Published | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov, Vitaly, Scalable belief propagation via relaxed scheduling. 33. 2020
[Published Version] View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Published | 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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2019 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


10 Publications

Mark all

[10]
2022 | Published | Conference Paper | IST-REx-ID: 11183 | OA
A. Nikabadi and J. Korhonen, “Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.
[Published Version] View | Files available | DOI
 
[9]
2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
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
 
[8]
2021 | Published | Conference Paper | IST-REx-ID: 11464 | OA
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
 
[7]
2021 | Published | Conference Paper | IST-REx-ID: 10854 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual, Online, 2021, pp. 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2021 | Published | 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, vol. 34. Springer Nature, pp. 463–487, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[4]
2020 | Published | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov, Vitaly, Scalable belief propagation via relaxed scheduling. 33. 2020
[Published Version] View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Published | 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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2019 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed