## Topological and combinatorial methods in Theoretical Distributed Computing

Dmitry Feichtner-Kozlov

Institute for Algebra, Geometry, Topology, and their Applications, University of Bremen

November 7, 2015

In the first half of the talk I will give a very compressed introduction into parts of Theoretical Distributed Computing from the point of view of mathematician. I will describe how to construct simplicial models whose combinatorics contains important information about computability and complexity of standard distributed tasks. In the second part, I will outline our recent progress on estimating the complexity of the so-called Weak Symmetry Breaking task, where we are able to derive some quite surprising results.