Jan Studený

22 papers A* 1A 2B 7Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2025 B conf
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
SIROCCO
Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
2024 B conf
Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
SPAA
Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
2024 — —
Designing and finding very fast distributed algorithms for bounded-degree graphs.
Jan Studený
2024 B conf
Local Problems in Trees Across a Wide Range of Distributed Models.
OPODIS
Anubhav Dhar, Eli Kujawa, Henrik Lievonen, Augusto Modanese, Mikail Muftuoglu, Jan Studený, Jukka Suomela
2024 J jnl
Local problems in trees across a wide range of distributed models.
CoRR
Anubhav Dhar, Eli Kujawa, Henrik Lievonen, Augusto Modanese, Mikail Muftuoglu, Jan Studený, Jukka Suomela
2024 J jnl
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
CoRR
Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
2023 J jnl
Distributed graph problems through an automata-theoretic lens.
Theor. Comput. Sci.
Yi-Jun Chang, Jan Studený, Jukka Suomela
2023 B conf
Fast Dynamic Programming in Trees in the MPC Model.
SPAA
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
2023 J jnl
Fast Dynamic Programming in Trees in the MPC Model.
CoRR
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
2023 J jnl
Locally checkable problems in rooted trees.
Distributed Comput.
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
2023 — conf
Sinkless Orientation Made Simple.
SOSA
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
2022 J jnl
Efficient Classification of Local Problems in Regular Trees.
CoRR
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela
2022 A conf
Efficient Classification of Locally Checkable Problems in Regular Trees.
DISC
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela
2022 B conf
Sparse Matrix Multiplication in the Low-Bandwidth Model.
SPAA
Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela
2022 J jnl
Sparse matrix multiplication in the low-bandwidth model.
CoRR
Chetan Gupta, Juho Hirvonen, Janne Korhonen, Jan Studený, Jukka Suomela
2021 B conf
Distributed Graph Problems Through an Automata-Theoretic Lens.
SIROCCO
Yi-Jun Chang, Jan Studený, Jukka Suomela
2021 A* conf
Locally Checkable Problems in Rooted Trees.
PODC
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
2021 J jnl
Locally Checkable Problems in Rooted Trees.
CoRR
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
2020 A conf
Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens.
DISC
Yi-Jun Chang, Jan Studený, Jukka Suomela
2020 J jnl
Distributed graph problems through an automata-theoretic lens.
CoRR
Yi-Jun Chang, Jan Studený, Jukka Suomela
2019 B conf
Approximating Approximate Pattern Matching.
CPM
Jan Studený, Przemyslaw Uznanski
2018 J jnl
Approximating Approximate Pattern Matching.
CoRR
Jan Studený, Przemyslaw Uznanski