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
1762020
Improved deterministic network decomposition
M Ghaffari, C Grunau, V Rozhoň
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
702021
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
252021
Undirected (1+𝜀)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
V Rozhoň, C Grunau, B Haeupler, G Zuzic, J Li
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
242022
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
242021
Local distributed rounding: Generalized to mis, matching, set cover, and beyond
S Faour, M Ghaffari, C Grunau, F Kuhn, V Rozhoň
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
142023
A local approach to the Erdös--Sós conjecture
V Rozhoň
SIAM Journal on Discrete Mathematics 33 (2), 643-664, 2019
142019
Improved distributed network decomposition, hitting sets, and spanners, via derandomization
M Ghaffari, C Grunau, B Haeupler, S Ilchi, V Rozhoň
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
132023
Deterministic low-diameter decompositions for weighted graphs and distributed and parallel applications
V Rozhoň, M Elkin, C Grunau, B Haeupler
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
122022
Cut distance identifying graphon parameters over weak* limits
M Doležal, J Grebík, J Hladkŭ, I Rocha, V Rozhoň
Journal of Combinatorial Theory, Series A 189, 105615, 2022
122022
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
102021
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
92022
Classification of local problems on paths from the perspective of descriptive combinatorics
J Grebík, V Rozhoň
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
92021
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
92020
Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
V Rozhoň, B Haeupler, A Martinsson, C Grunau, G Zuzic
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 321-334, 2023
72023
Deterministic distributed sparse and ultra-sparse spanners and connectivity certificates
M Bezdrighin, M Elkin, M Ghaffari, C Grunau, B Haeupler, S Ilchi, ...
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022
72022
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
72021
On homomorphism graphs
S Brandt, YJ Chang, J Grebík, C Grunau, V Rozhoň, Z Vidnyánszky
arXiv preprint arXiv:2111.03683, 2021
62021
A nearly tight analysis of greedy k-means++
C Grunau, AA Özüdoğru, V Rozhoň, J Tětek
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
52023
Adapting k-means algorithms for outliers
C Grunau, V Rozhoň
International Conference on Machine Learning, 7845-7886, 2022
52022
The system can't perform the operation now. Try again later.
Articles 1–20