Václav Rozhon

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 53

Top Topics

Distributed Network

Partial Information

Top Venues

Publications

Amirreza Akbari, Xavier Coiteux-Roy, Francesco D'Amore, François Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Václav Rozhon, Jukka Suomela
Online Locality Meets Distributed Quantum Computing. CoRR (2024)
Václav Rozhon
Invitation to Local Algorithms. CoRR (2024)
Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon
-Center Clustering. SODA (2024)
Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Fast and Simple Sorting Using Partial Information. CoRR (2024)
Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. SODA (2023)
Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR (2023)
Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. SODA (2023)
Václav Rozhon, Bernhard Haeupler, Christoph Grunau
A Simple Deterministic Distributed Low-Diameter Clustering. SOSA (2023)
Mohsen Ghaffari, Christoph Grunau, Václav Rozhon
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. FOCS (2023)
Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. STOC (2023)
Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon
Noisy k-means++ Revisited. CoRR (2023)
Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon
Noisy k-Means++ Revisited. ESA (2023)
Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek
A Nearly Tight Analysis of Greedy k-means++. SODA (2023)
Mohsen Ghaffari, Christoph Grunau, Václav Rozhon
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. CoRR (2023)
Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram
Fully Dynamic Consistent k-Center Clustering. CoRR (2023)
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. ITCS (2022)
Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. SPAA (2022)
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees. CoRR (2022)
Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. CoRR (2022)
Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon
Cut distance identifying graphon parameters over weak* limits. J. Comb. Theory, Ser. A 189 (2022)
Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. STOC (2022)
Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek
A Nearly Tight Analysis of Greedy k-means++. CoRR (2022)
Christoph Grunau, Václav Rozhon
Adapting k-means Algorithms for Outliers. ICML (2022)
Michael Elkin, Bernhard Haeupler, Václav Rozhon, Christoph Grunau
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. CoRR (2022)
Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. CoRR (2022)
Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. CoRR (2022)
Christoph Grunau, Václav Rozhon, Sebastian Brandt
The Landscape of Distributed Complexities on Trees and Beyond. CoRR (2022)
Václav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. FOCS (2022)
Christoph Grunau, Václav Rozhon, Sebastian Brandt
The Landscape of Distributed Complexities on Trees and Beyond. PODC (2022)
Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. CoRR (2022)
Václav Rozhon, Bernhard Haeupler, Christoph Grunau
A Simple Deterministic Distributed Low-Diameter Clustering. CoRR (2022)
Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. CoRR (2022)
Jan Grebík, Václav Rozhon
Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics. CoRR (2021)
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. CoRR (2021)
Sebastian Brandt, Christoph Grunau, Václav Rozhon
The randomized local computation complexity of the Lovász local lemma. CoRR (2021)
Jan Grebík, Václav Rozhon
Of Toasts and Tails. CoRR (2021)
Sebastian Brandt, Christoph Grunau, Václav Rozhon
The Randomized Local Computation Complexity of the Lovász Local Lemma. PODC (2021)
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky
On Homomorphism Graphs. CoRR (2021)
Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon
Relating the cut distance and the weak* topology for graphons. J. Comb. Theory, Ser. B 147 (2021)
Mohsen Ghaffari, Christoph Grunau, Václav Rozhon
Improved Deterministic Network Decomposition. SODA (2021)
Sebastian Brandt, Christoph Grunau, Václav Rozhon
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. CoRR (2020)
Sebastian Brandt, Christoph Grunau, Václav Rozhon
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. PODC (2020)
Christoph Grunau, Václav Rozhon
Adapting k-means algorithms for outliers. CoRR (2020)
Václav Rozhon, Mohsen Ghaffari
Polylogarithmic-time deterministic network decomposition and distributed derandomization. STOC (2020)
Mohsen Ghaffari, Christoph Grunau, Václav Rozhon
Improved Deterministic Network Decomposition. CoRR (2020)
Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon
k-means++: few more steps yield constant approximation. CoRR (2020)
Václav Rozhon
Simple and sharp analysis of k-means||. CoRR (2020)
Tereza Klimosová, Diana Piguet, Václav Rozhon
A version of the Loebl-Komlós-Sós conjecture for skew trees. Eur. J. Comb. 88 (2020)
Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon
k-means++: few more steps yield constant approximation. ICML (2020)
Václav Rozhon
Simple and sharp analysis of k-means||. ICML (2020)
Václav Rozhon
A Local Approach to the Erdös-Sós Conjecture. SIAM J. Discret. Math. 33 (2) (2019)
Václav Rozhon, Mohsen Ghaffari
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization. CoRR (2019)
Tereza Klimosová, Diana Piguet, Václav Rozhon
A skew version of the Loebl-Komlós-Sós conjecture. Electron. Notes Discret. Math. 61 (2017)