Václav Rozhon

Orcid: 0000-0002-9646-8446

According to our database1, Václav Rozhon authored at least 33 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Online Locality Meets Distributed Quantum Computing.
CoRR, 2024

Fully Dynamic Consistent <i>k</i>-Center Clustering.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps.
CoRR, 2023

Fully Dynamic Consistent k-Center Clustering.
CoRR, 2023

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

A Simple Deterministic Distributed Low-Diameter Clustering.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

A Nearly Tight Analysis of Greedy k-means++.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Noisy k-Means++ Revisited.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Cut distance identifying graphon parameters over weak* limits.
J. Comb. Theory, Ser. A, 2022

Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees.
CoRR, 2022

Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms.
CoRR, 2022

Undirected (1+<i>ε</i>)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

The Landscape of Distributed Complexities on Trees and Beyond.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Adapting k-means Algorithms for Outliers.
Proceedings of the International Conference on Machine Learning, 2022

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Relating the cut distance and the weak* topology for graphons.
J. Comb. Theory, Ser. B, 2021

On Homomorphism Graphs.
CoRR, 2021

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics.
CoRR, 2021

Of Toasts and Tails.
CoRR, 2021

Improved Deterministic Network Decomposition.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

The Randomized Local Computation Complexity of the Lovász Local Lemma.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
A version of the Loebl-Komlós-Sós conjecture for skew trees.
Eur. J. Comb., 2020

Polylogarithmic-time deterministic network decomposition and distributed derandomization.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Simple and sharp analysis of k-means||.
Proceedings of the 37th International Conference on Machine Learning, 2020

k-means++: few more steps yield constant approximation.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
A Local Approach to the Erdös-Sós Conjecture.
SIAM J. Discret. Math., 2019

2017
A skew version of the Loebl-Komlós-Sós conjecture.
Electron. Notes Discret. Math., 2017


  Loading...