| Improved deterministic network decomposition M Ghaffari, C Grunau, V Rozhoň Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 83 | 2021 |
| 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 | 39 | 2022 |
| 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 | 31 | 2021 |
| Improved MPC algorithms for MIS, matching, and coloring on trees and beyond M Ghaffari, C Grunau, C Jin arXiv preprint arXiv:2002.09610, 2020 | 27 | 2020 |
| 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 | 24 | 2023 |
| 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 | 21 | 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 | 17 | 2022 |
| Faster deterministic distributed MIS and approximate matching M Ghaffari, C Grunau Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1777-1790, 2023 | 16 | 2023 |
| 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 | 15 | 2023 |
| 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 | 14 | 2022 |
| 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 | 14 | 2021 |
| 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 | 13 | 2023 |
| 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 | 13 | 2020 |
| Improved local computation algorithm for set cover via sparsification C Grunau, S Mitrović, R Rubinfeld, A Vakilian Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 13 | 2020 |
| On homomorphism graphs S Brandt, YJ Chang, J Grebík, C Grunau, V Rozhoň, Z Vidnyánszky Forum of Mathematics, Pi 12, e10, 2024 | 12 | 2024 |
| 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 | 11 | 2022 |
| Adapting k-means algorithms for outliers C Grunau, V Rozhoň International Conference on Machine Learning, 7845-7886, 2022 | 8 | 2022 |
| Fully Dynamic Consistent k-Center Clustering J Łącki, B Haeupler, C Grunau, R Jayaram, V Rozhoň Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 7 | 2024 |
| Improved deterministic connectivity in massively parallel computation M Fischer, J Giliberti, C Grunau arXiv preprint arXiv:2206.01568, 2022 | 6 | 2022 |
| k-means++: few more steps yield constant approximation D Choo, C Grunau, J Portmann, V Rozhon International Conference on Machine Learning, 1909-1917, 2020 | 5 | 2020 |
Václav RozhoňINSAIT, SofiaEmail verificata su ethz.ch