( en | de | ru )

 

Disambiguation of "Rozhon, Václav"

Author of the publication

copydeleteadd this publication to your clipboard
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics.

, , , , , and . CoRR, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Václav Frolec

Václav Umlauf

Václav Pohl

Václav Kazda

Václav RÌ ehounek

 

Other publications of authors with the same name

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances., , , , and . STOC, page 321-334. ACM, (2023)Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma., , and . PODC, page 329-338. ACM, (2020)k-means++: few more steps yield constant approximation., , , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 1909-1917. PMLR, (2020)Fast and Simple Sorting Using Partial Information., , , , , and . CoRR, (2024)Fully Dynamic Consistent k-Center Clustering., , , , and . SODA, page 3463-3484. SIAM, (2024)The Randomized Local Computation Complexity of the Lovász Local Lemma., , and . PODC, page 307-317. ACM, (2021)The Landscape of Distributed Complexities on Trees and Beyond., , and . PODC, page 37-47. ACM, (2022)Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms., , , , and . STOC, page 478-487. ACM, (2022)Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps., , , , and . CoRR, (2023)Polylogarithmic-time deterministic network decomposition and distributed derandomization., and . STOC, page 350-363. ACM, (2020)