Rozhon, Vaclav
61  results:
Search for persons X
?
1

ON HOMOMORPHISM GRAPHS:

Brandt, Sebastian ; Chang, Yi-Jun ; Grebík, Jan...
Forum of Mathematics, Pi.  12 (2024)  - p. , 2024
 
?
2

Work-Efficient Parallel Derandomization I: Chernoff-like Co..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
 
?
3

Measurable Tilings by Abelian Group Actions:

Grebík, Jan ; Greenfeld, Rachel ; Rozhoň, Václav.
International Mathematics Research Notices.  2023 (2023)  23 - p. 20211-20251 , 2023
 
?
4

Parallel Breadth-First Search and Exact Shortest Paths and ..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
 
?
6

Deterministic Distributed Sparse and Ultra-Sparse Spanners ..:

, In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
 
?
7

Undirected (1+𝜀)-shortest paths via minor-aggregates: near-..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
 
?
8

Cut distance identifying graphon parameters over weak* limi..:

Doležal, Martin ; Grebík, Jan ; Hladký, Jan..
Journal of Combinatorial Theory, Series A.  189 (2022)  - p. 105615 , 2022
 
?
9

The Landscape of Distributed Complexities on Trees and Beyo..:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,
 
?
10

Deterministic Low-Diameter Decompositions for Weighted Grap..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Rozhon, Vaclav ; Elkin, Michael ; Grunau, Christoph. - p. 1114-1121 , 2022
 
?
11

Improved Deterministic Network Decomposition:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
 
?
12

Classification of Local Problems on Paths from the Perspect..:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,
Grebík, Jan ; Rozhoň, Václav - p. 553-559 , 2021
 
?
13

Improved deterministic network decomposition:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
 
?
14

The Randomized Local Computation Complexity of the Lovász L..:

, In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing,
 
?
15

Relating the cut distance and the weak* topology for grapho..:

Doležal, Martin ; Grebík, Jan ; Hladký, Jan..
Journal of Combinatorial Theory, Series B.  147 (2021)  - p. 252-298 , 2021
 
1-15