Václav Rozhoň

I am fortunate to be a PhD student in the group of Mohsen Ghaffari at ETH, Zurich. Before coming to ETH, I studied at Charles University, Prague and worked in the group of Diana Piguet.

I am a proud pledger at Giving what we can. Check out GiveWell, too!

If you wish to contact me, please use my email [name][surname]@gmail.com

CV

Teaching

Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics

Papers

• Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhoň, Zoltán Vidnyánszky: Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
  [arXiv]
• Sebastian Brandt, Christoph Grunau, Václav Rozhoň: The randomized local computation complexity of the Lovász local lemma
  Principles of Distributed Computing (PODC) 2021;
  [arXiv], [talk about the ID graph trick]
• Jan Grebík, Václav Rozhoň: Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics
  EUROCOMB 2021
  [arXiv]
• Jan Grebík, Václav Rozhoň: Local Problems on Grids from the Perspective of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
  [arXiv], [talk]
• Mohsen Ghaffari, Christoph Grunau, Václav Rozhoň: Improved Deterministic Network Decomposition
  ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021;
  [arXiv]
• Sebastian Brandt, Christoph Grunau, Václav Rozhoň: Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
  Principles of Distributed Computing (PODC) 2020;
  [arXiv], [slides]
• Václav Rozhoň: Simple and sharp analysis of k-means||
  International Conference on Machine Learning (ICML) 2020;
  [arXiv], [slides], [talk],
• Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhoň: k-means++: few more steps yield constant approximation
  International Conference on Machine Learning (ICML) 2020;
  [arXiv], [slides]
• Václav Rozhoň, Mohsen Ghaffari: Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
  Symposium on Theory of Computing (STOC) 2020;
  [arXiv], [slides] [talk]
• Martin Doležal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhoň: Cut distance identifying graphon parameters over weak* limits
  Submitted;
  [arXiv], [slides]
• Martin Doležal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhoň: Relating the cut distance and the weak* topology for graphons
  Journal of Combinatorial Theory, series B;
  [arXiv]
• Václav Rozhoň: A local approach to the Erdős-Sós conjecture
  SIAM Journal on Discrete Mathematics;
  [arXiv], [pdf], [slides]
• Tereza Klimošová, Diana Piguet, Václav Rozhoň: A version of the Loebl-Komlós-Sós conjecture for skewed trees
  EUROCOMB 2017, European Journal on Combinatorics for EUROCOMB 2017;
  [arXiv], [extended abstract]
  

Other reports

• Master thesis.
  [pdf]
• Study text about probability for high school students (in Czech)
  [1,2,3]
• Bachelor thesis.
  [pdf] [slides]