Jan Studený

According to our database, Jan Studený authored at least 14 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Designing and finding very fast distributed algorithms for bounded-degree graphs.

Jan Studený

PhD thesis, 2024

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

CoRR, 2024

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.

Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi

CoRR, 2024

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.

Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023

Locally checkable problems in rooted trees.

Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko

Distributed Comput., September, 2023

Distributed graph problems through an automata-theoretic lens.

Yi-Jun Chang, Jan Studený, Jukka Suomela

Theor. Comput. Sci., March, 2023

Fast Dynamic Programming in Trees in the MPC Model.

Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Sinkless Orientation Made Simple.

Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

Efficient Classification of Local Problems in Regular Trees.

Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela

CoRR, 2022

Efficient Classification of Locally Checkable Problems in Regular Trees.

Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Sparse Matrix Multiplication in the Low-Bandwidth Model.

Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021

Locally Checkable Problems in Rooted Trees.

Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens.

Yi-Jun Chang, Jan Studený, Jukka Suomela

Proceedings of the 34th International Symposium on Distributed Computing, 2020

2019

Approximating Approximate Pattern Matching.

Jan Studený, Przemyslaw Uznanski

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019