Æȷοì
Václav Rozhoň
Václav Rozhoň
´Ù¸¥ À̸§Vaclav Rozhon
INSAIT, Sofia
È®ÀÎµÈ À̸ÞÀÏ ¾øÀ½ - ȨÆäÀÌÁö
Á¦¸ñ
Àοë
Àοë
¿¬µµ
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
2002020
Improved deterministic network decomposition
M Ghaffari, C Grunau, V Rozhoň
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA ¡¦, 2021
852021
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
412022
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
362021
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
352021
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
282023
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
252023
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
192022
A local approach to the Erdös--Sós conjecture
V Rozhoň
SIAM Journal on Discrete Mathematics 33 (2), 643-664, 2019
182019
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
152023
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
152021
On homomorphism graphs
S Brandt, YJ Chang, J Grebík, C Grunau, V Rozhoň, Z Vidnyánszky
Forum of Mathematics, Pi 12, e10, 2024
142024
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
142022
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
142021
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
142020
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
132023
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
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
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
112024
Online Locality Meets Distributed Quantum Computing
A Akbari, X Coiteux-Roy, F d'Amore, FL Gall, H Lievonen, D Melnyk, ...
arXiv preprint arXiv:2403.01903, 2024
92024
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–20