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, October 22, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Yi-Jun Chang

Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization

In this talk, we will discuss a recent line of research in distributed graph algorithms in the CONGEST model that exploit expanders. All these algorithms so far are based on two tools: expander decomposition and expander routing. An expander decomposition removes a small fraction of the edges so that the remaining connected components have high conductance, and expander routing allows each vertex v in a high-conductance component to very quickly exchange deg(v) messages with any other vertices in the same component, not just its local neighbors. This talk will focus on my recent work with Thatchaphol Saranurak in FOCS 2020 (, where we gave the first efficient deterministic distributed algorithms for both tools.

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