Jan Studený

Orcid: 0000-0002-9887-5192

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Local problems in trees across a wide range of distributed models.
CoRR, 2024

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

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023
Locally checkable problems in rooted trees.
Distributed Comput., September, 2023

Distributed graph problems through an automata-theoretic lens.
Theor. Comput. Sci., March, 2023

Fast Dynamic Programming in Trees in the MPC Model.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Sinkless Orientation Made Simple.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022
Efficient Classification of Local Problems in Regular Trees.
CoRR, 2022

Efficient Classification of Locally Checkable Problems in Regular Trees.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Sparse Matrix Multiplication in the Low-Bandwidth Model.
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.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

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


  Loading...