Follow
Václav Rozhoň
Václav Rozhoň
Other namesVaclav Rozhon
Verified email at ethz.ch - Homepage
Title
Cited by
Cited by
Year
Polylogarithmic-time deterministic network decomposition and distributed derandomization
V Rozhoň, M Ghaffari
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
1272020
Improved deterministic network decomposition
M Ghaffari, C Grunau, V Rozhoň
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
472021
Local Problems on Grids from the Perspective of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
J Grebík, V Rozhoň
arXiv preprint arXiv:2103.08394, 2021
12*2021
Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics
S Brandt, YJ Chang, J Grebík, C Grunau, V Rozhoň, Z Vidnyánszky
arXiv preprint arXiv:2106.02066, 2021
112021
A local approach to the Erdös--Sós conjecture
V Rozhoň
SIAM Journal on Discrete Mathematics 33 (2), 643-664, 2019
92019
Cut distance identifying graphon parameters over weak* limits
M Doležal, J Grebík, J Hladký, I Rocha, V Rozhoň
arXiv preprint arXiv:1809.03797, 2018
9*2018
Relating the cut distance and the weak* topology for graphons
M Doležal, J Grebík, J Hladký, I Rocha, V Rozhoň
Journal of Combinatorial Theory, Series B 147, 252-298, 2021
82021
The randomized local computation complexity of the Lovász local lemma
S Brandt, C Grunau, V Rozhoň
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
72021
Generalizing the sharp threshold phenomenon for the distributed complexity of the lovász local lemma
S Brandt, C Grunau, V Rozhoň
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
72020
On homomorphism graphs
S Brandt, YJ Chang, J Grebík, C Grunau, V Rozhoň, Z Vidnyánszky
arXiv preprint arXiv:2111.03683, 2021
42021
A version of the Loebl–Komlós–Sós conjecture for skew trees
T Klimošová, D Piguet, V Rozhoň
European Journal of Combinatorics 88, 103106, 2020
4*2020
Classification of local problems on paths from the perspective of descriptive combinatorics
J Grebík, V Rozhoň
Extended Abstracts EuroComb 2021, 553-559, 2021
32021
Sufficient conditions for embedding trees
V Rozhoň
Univerzita Karlova, Matematicko-fyzikální fakulta, 2018
32018
The landscape of distributed complexities on trees and beyond
C Grunau, V Rozhoň, S Brandt
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
22022
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates
M Bezdrighin, M Elkin, M Ghaffari, C Grunau, B Haeupler, S Ilchi, ...
arXiv preprint arXiv:2204.14086, 2022
22022
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications
M Elkin, B Haeupler, V Rozhoň, C Grunau
arXiv preprint arXiv:2204.08254, 2022
22022
k-means++: few more steps yield constant approximation
D Choo, C Grunau, J Portmann, V Rozhon
International Conference on Machine Learning, 1909-1917, 2020
22020
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization
M Ghaffari, C Grunau, B Haeupler, S Ilchi, V Rozhoň
arXiv preprint arXiv:2209.11669, 2022
12022
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
S Faour, M Ghaffari, C Grunau, F Kuhn, V Rozhoň
arXiv preprint arXiv:2209.11651, 2022
12022
Adapting k-means algorithms for outliers
C Grunau, V Rozhoň
International Conference on Machine Learning, 7845-7886, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–20