10 Publications

Mark all

[10]
2022 | Published | Conference Paper | IST-REx-ID: 11183 | OA
Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters
A. Nikabadi, J. Korhonen, in:, Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[Published Version] View | Files available | DOI
 
[9]
2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2021 | Published | Conference Paper | IST-REx-ID: 10854 | OA
Input-dynamic distributed algorithms for communication networks
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[7]
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
Input-dynamic distributed algorithms for communication networks
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 11464 | OA
Towards tight communication lower bounds for distributed optimisation
D.-A. Alistarh, J. Korhonen, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 7254–7266.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[5]
2021 | Published | Journal Article | IST-REx-ID: 7939 | OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[4]
2020 | Published | Conference Paper | IST-REx-ID: 9631 | OA
Scalable belief propagation via relaxed scheduling
V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Published | Conference Paper | IST-REx-ID: 6933 | OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[2]
2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
Does preprocessing help under congestion?
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2019 | Published | Journal Article | IST-REx-ID: 7150 | OA
Algebraic methods in the congested clique
K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Export / Embed

Grants


10 Publications

Mark all

[10]
2022 | Published | Conference Paper | IST-REx-ID: 11183 | OA
Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters
A. Nikabadi, J. Korhonen, in:, Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[Published Version] View | Files available | DOI
 
[9]
2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2021 | Published | Conference Paper | IST-REx-ID: 10854 | OA
Input-dynamic distributed algorithms for communication networks
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[7]
2021 | Published | Journal Article | IST-REx-ID: 10855 | OA
Input-dynamic distributed algorithms for communication networks
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Published | Conference Paper | IST-REx-ID: 11464 | OA
Towards tight communication lower bounds for distributed optimisation
D.-A. Alistarh, J. Korhonen, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 7254–7266.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[5]
2021 | Published | Journal Article | IST-REx-ID: 7939 | OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[4]
2020 | Published | Conference Paper | IST-REx-ID: 9631 | OA
Scalable belief propagation via relaxed scheduling
V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Published | Conference Paper | IST-REx-ID: 6933 | OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[2]
2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
Does preprocessing help under congestion?
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2019 | Published | Journal Article | IST-REx-ID: 7150 | OA
Algebraic methods in the congested clique
K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Export / Embed