| 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 | 148 | 2020 |
| Improved deterministic network decomposition M Ghaffari, C Grunau, V Rozhoň Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 60 | 2021 |
| 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 | 16* | 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 | 15 | 2021 |
| A local approach to the Erdös--Sós conjecture V Rozhoň SIAM Journal on Discrete Mathematics 33 (2), 643-664, 2019 | 13 | 2019 |
| 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 | 11 | 2022 |
| 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 | 11* | 2018 |
| 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 | 9 | 2021 |
| 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 | 8 | 2021 |
| 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 | 8 | 2020 |
| On homomorphism graphs S Brandt, YJ Chang, J Grebík, C Grunau, V Rozhoň, Z Vidnyánszky arXiv preprint arXiv:2111.03683, 2021 | 6 | 2021 |
| 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 | 6 | 2021 |
| 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 | 5 | 2023 |
| 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 | 5 | 2022 |
| 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 | 4 | 2023 |
| 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 |
| Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances V Rozhoň, B Haeupler, A Martinsson, C Grunau, G Zuzic arXiv preprint arXiv:2210.16351, 2022 | 3 | 2022 |
| 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 | 3 | 2022 |
| Adapting k-means algorithms for outliers C Grunau, V Rozhoň International Conference on Machine Learning, 7845-7886, 2022 | 3 | 2022 |
| Sufficient conditions for embedding trees V Rozhoň Univerzita Karlova, Matematicko-fyzikální fakulta, 2018 | 3 | 2018 |
Christoph GrunauETH ZurichVerified email at inf.ethz.ch
