Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 09, 2021, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Vaclav Rozhon

Distributed Algorithms and Set Theory

It is an important statement in the theory of distributed computing that deterministic algorithms that color a Delta-regular tree with Delta colors need at least log(n) time to finish. It was proven by Brand et al. in 2016 but, funnily enough, it also directly follows from a set theoretical result proven by Marks in 2013. I will explain (a finite version of) Marks' proof and maybe talk about some recent developments around it that are joint with Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, and Zoltán Vidnyánszky.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login