Janne Korhonen

Alistarh Group

10 Publications

Mark all

[10]
2022 | Published | Conference Paper | IST-REx-ID: 11183 | OA
Nikabadi A, Korhonen J. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.15
[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
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2021 | Published | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. Distributed Computing. 2021;34:463-487. doi:10.1007/s00446-020-00380-5
[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
Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. Algebraic methods in the congested clique. Distributed Computing. 2019;32(6):461-478. doi:10.1007/s00446-016-0270-2
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Published | Conference Paper | IST-REx-ID: 6933 | OA
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. ACM; 2019:74-83. doi:10.1145/3293611.3331633
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
Foerster K-T, Korhonen J, Rybicki J, Schmid S. Does preprocessing help under congestion? In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM; 2019:259-261. doi:10.1145/3293611.3331581
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


10 Publications

Mark all

[10]
2022 | Published | Conference Paper | IST-REx-ID: 11183 | OA
Nikabadi A, Korhonen J. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.15
[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
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2021 | Published | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. Distributed Computing. 2021;34:463-487. doi:10.1007/s00446-020-00380-5
[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
Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. Algebraic methods in the congested clique. Distributed Computing. 2019;32(6):461-478. doi:10.1007/s00446-016-0270-2
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Published | Conference Paper | IST-REx-ID: 6933 | OA
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. ACM; 2019:74-83. doi:10.1145/3293611.3331633
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
Foerster K-T, Korhonen J, Rybicki J, Schmid S. Does preprocessing help under congestion? In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM; 2019:259-261. doi:10.1145/3293611.3331581
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed