Janne Korhonen

Alistarh Group

10 Publications

Mark all

[10]
2022 | Conference Paper | IST-REx-ID: 11183 | OA
Nikabadi A, Korhonen J. 2022. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. 25th International Conference on Principles of Distributed Systems. OPODIS, LIPIcs, vol. 217, 15.
[Published Version] View | Files available | DOI
 
[9]
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. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 58.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2021 | Conference Paper | IST-REx-ID: 11464 | OA
Alistarh D-A, Korhonen J. 2021. Towards tight communication lower bounds for distributed optimisation. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 7254–7266.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[7]
2021 | Conference Paper | IST-REx-ID: 10854 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Journal Article | IST-REx-ID: 10855 | OA
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. 5(1), 1–33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2021 | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing. 34, 463–487.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via relaxed scheduling. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 22361–22372.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[3]
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. 32(6), 461–478.
[Preprint] View | 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? Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
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. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed Computing, 74–83.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed

10 Publications

Mark all

[10]
2022 | Conference Paper | IST-REx-ID: 11183 | OA
Nikabadi A, Korhonen J. 2022. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. 25th International Conference on Principles of Distributed Systems. OPODIS, LIPIcs, vol. 217, 15.
[Published Version] View | Files available | DOI
 
[9]
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. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 58.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2021 | Conference Paper | IST-REx-ID: 11464 | OA
Alistarh D-A, Korhonen J. 2021. Towards tight communication lower bounds for distributed optimisation. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 7254–7266.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[7]
2021 | Conference Paper | IST-REx-ID: 10854 | OA
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[6]
2021 | Journal Article | IST-REx-ID: 10855 | OA
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. 5(1), 1–33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2021 | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing. 34, 463–487.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via relaxed scheduling. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 22361–22372.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[3]
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. 32(6), 461–478.
[Preprint] View | 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? Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
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. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed Computing, 74–83.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed