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
Teaching
Advanced algorithms (teaching assistant, Fall 2021)
Principles of distributed computing (teaching assistant, Spring 2021)
Advanced algorithms (teaching assistant, Fall 2020)
Principles of distributed computing (teaching assistant, Spring 2020)
Advanced algorithms (teaching assistant, Fall 2019)
Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
Some time ago, I gave a very informal tutorial on what we know about the relation of distributed algorithms, finitary factors, and descriptive combinatorics.
Also, see this nice talk by Anton and this nice survey by Oleg Pikhurko about descriptive combinatorics.
Video 1,
Video 2,
Video 3,
Video 4,
Video 5,
Video 6.
Papers
My Google Scholar page

Sebastian Brandt, YiJun 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
ACMSIAM 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 kmeans
International Conference on Machine Learning (ICML) 2020;
[arXiv],
[slides],
[talk],

Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhoň:
kmeans++: few more steps yield constant approximation
International Conference on Machine Learning (ICML) 2020;
[arXiv],
[slides]

Václav Rozhoň, Mohsen Ghaffari:
PolylogarithmicTime 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ősSós conjecture
SIAM Journal on Discrete Mathematics;
[arXiv],
[pdf],
[slides]

Tereza Klimošová, Diana Piguet, Václav Rozhoň:
A version of the LoeblKomlósSó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]