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.
LibreCat: https://research-explorer.ista.ac.at/record/11183
DOI: 10.4230/LIPIcs.OPODIS.2021.15

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.
LibreCat: https://research-explorer.ista.ac.at/record/10219
DOI: 10.4230/LIPIcs.DISC.2021.58
arXiv: 2108.02655

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.
LibreCat: https://research-explorer.ista.ac.at/record/11464
arXiv: 2010.08222

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.
LibreCat: https://research-explorer.ista.ac.at/record/10854
DOI: 10.1145/3410220.3453923
arXiv: 2005.07637

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.
LibreCat: https://research-explorer.ista.ac.at/record/10855
DOI: 10.1145/3447384
arXiv: 2005.07637

Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.
LibreCat: https://research-explorer.ista.ac.at/record/7939
DOI: 10.1007/s00446-020-00380-5
WoS: 000556444600001
arXiv: 1903.05956

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.
LibreCat: https://research-explorer.ista.ac.at/record/9631
arXiv: 2002.11505

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.
LibreCat: https://research-explorer.ista.ac.at/record/7150
DOI: 10.1007/s00446-016-0270-2
arXiv: 1503.04963

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.
LibreCat: https://research-explorer.ista.ac.at/record/6935
DOI: 10.1145/3293611.3331581
WoS: 000570442000037
arXiv: 1905.03012

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.
LibreCat: https://research-explorer.ista.ac.at/record/6933
DOI: 10.1145/3293611.3331633
WoS: 000570442000011
arXiv: 1903.05956