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, February 21, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Mohsen Ghaffari

LOCAL Algorithms: The Chasm Between Randomized and Deterministic

How do computer networks solve their graph problems? In 1987, Linial introduced the LOCAL model of computation, which nicely captures this question, and has been studied extensively since then. The model is as follows: Given a graph G=(V, E), initially, each node of the graph knows only its neighbors, and per round, each node can send a message to each of its neighbors. The key question of interest is how many rounds are needed for solving a given graph problem, e.g., computing a coloring. In this talk, I will present an introductory survey of some of the classic problems of the area and the recent developments on them. The focus will be on what remains the most well-known open problem of the area since its beginning, the exponential gap between randomized and deterministic algorithms, our findings on it, and the path forward. This is based on joint works with Manuela Fischer, with Fabian Kuhn and Yannic Maus, and with Hsin-Hao Su.

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