Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Tuesday, October 27, 2020, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Vaclav Rozhon
Lovász local lemma (LLL) is among the most important problems studied in the area of distributed local algorithms. We show the problem is easy for LLL criterion p < 2-d, while already for the criterion p ≤ 2-d it is known to be much harder. Surprisingly, a crucial part of the proof is to show that certain obscure set is convex. Based on a paper of Brandt, Maus, and Uitto and a joint paper with Brandt and Grunau
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
