| Distributed graph problems through an automata-theoretic lens YJ Chang, J Studený, J Suomela Structural Information and Communication Complexity: 28th International …, 2021 | 19 | 2021 |
| Locally checkable problems in rooted trees A Balliu, S Brandt, D Olivetti, J Studený, J Suomela, A Tereshchenko Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 17 | 2021 |
| Efficient classification of local problems in regular trees A Balliu, S Brandt, YJ Chang, D Olivetti, J Studený, J Suomela arXiv preprint arXiv:2202.08544, 2022 | 4 | 2022 |
| Approximating approximate pattern matching J Studený, P Uznański arXiv preprint arXiv:1810.01676, 2018 | 4 | 2018 |
| Sinkless Orientation Made Simple A Balliu, JH Korhonen, F Kuhn, H Lievonen, D Olivetti, S Pai, A Paz, ... Symposium on Simplicity in Algorithms (SOSA), 175-191, 2023 | | 2023 |
| Sparse matrix multiplication in the low-bandwidth model C Gupta, J Hirvonen, JH Korhonen, J Studený, J Suomela Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | | 2022 |
| Brief announcement: Distributed graph problems through an automata-theoretic lens YJ Chang, J Studený, J Suomela 34th International Symposium on Distributed Computing (DISC 2020) 179, 41, 2020 | | 2020 |
Jukka SuomelaAalto UniversityVerified email at aalto.fi
Jukka SuomelaAalto UniversityVerified email at aalto.fi