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: Thursday, March 29, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Sebastian Brandt

A Speed-up Technique for Lower Bounds in the LOCAL Model

Recently [STOC '16], the best known lower bound for the distributed Lovász Local Lemma was improved from \Omega(log* n) to \Omega(log log n) by using a new lower bound technique based on the idea that, under certain circumstances, the existence of an algorithm implies the existence of a faster algorithm. This discovery led to other results, among them an exponential separation between randomized and deterministic complexity in the LOCAL model [FOCS '16]. Very recently [SODA '18], a refinement of said technique appeared in the context of edge colorings, facilitating a simpler analysis of the involved speed-up step. In this talk, we will take an in-depth look at the idea behind the lower bound technique and examine its simplified version.

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