Approximating Approximate Pattern Matching. - Jan Studený; Przemyslaw Uznanski (CPM, 2019)

Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. - Yi-Jun Chang; Jan Studený; Jukka Suomela (DISC, 2020)

Locally Checkable Problems in Rooted Trees. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (PODC, 2021)

Sparse Matrix Multiplication in the Low-Bandwidth Model. - Chetan Gupta 002; Juho Hirvonen; Janne H. Korhonen; Jan Studený; Jukka Suomela (SPAA, 2022)

Efficient Classification of Locally Checkable Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (DISC, 2022)

Efficient Classification of Local Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (CoRR, 2022)

Sinkless Orientation Made Simple. - Alkida Balliu; Janne H. Korhonen; Fabian Kuhn; Henrik Lievonen; Dennis Olivetti; Shreyas Pai; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jan Studený; Jukka Suomela; Jara Uitto (SOSA, 2023)

Fast Dynamic Programming in Trees in the MPC Model. - Chetan Gupta 002; Rustam Latypov; Yannic Maus; Shreyas Pai; Simo Särkkä; Jan Studený; Jukka Suomela; Jara Uitto; Hossein Vahidi 001 (SPAA, 2023)

Distributed graph problems through an automata-theoretic lens. - Yi-Jun Chang; Jan Studený; Jukka Suomela (Theor. Comput. Sci., 2023)

Locally checkable problems in rooted trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (Distributed Comput., 2023)

Local Problems in Trees Across a Wide Range of Distributed Models. - Anubhav Dhar; Eli Kujawa; Henrik Lievonen; Augusto Modanese; Mikail Muftuoglu; Jan Studený; Jukka Suomela (OPODIS, 2024)

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SPAA, 2024)

Designing and finding very fast distributed algorithms for bounded-degree graphs. - Jan Studený (2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SIROCCO, 2025)