Distributed graph problems through an automata-theoretic lens YJ Chang, J Studenę, J Suomela International Colloquium on Structural Information and Communication …, 2021 | 26 | 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 | 24 | 2021 |

Efficient classification of locally checkable problems in regular trees A Balliu, S Brandt, YJ Chang, D Olivetti, J Studenę, J Suomela arXiv preprint arXiv:2202.08544, 2022 | 9 | 2022 |

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 | 5 | 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 | 5 | 2022 |

Approximating approximate pattern matching J Studenę, P Uznański arXiv preprint arXiv:1810.01676, 2018 | 5 | 2018 |

Fast dynamic programming in trees in the mpc model C Gupta, R Latypov, Y Maus, S Pai, S Särkkä, J Studenę, J Suomela, ... Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 2 | 2023 |

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity C Gupta, JH Korhonen, J Studenę, J Suomela, H Vahidi arXiv preprint arXiv:2404.15559, 2024 | 1 | 2024 |

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity C Gupta, JH Korhonen, J Studenę, J Suomela, H Vahidi Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024 | | 2024 |

Efficient Classification of Local Problems in Regular Trees S BRANDT, Y CHANG, JAN STUDENĘ arXiv preprint arXiv:2202.08544, 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 |