Combinatorial Structures for Distributed Computing Models

114 views · Published 14 March 2016 · 43:52 · Indexed 27 October 2026

Channel: Institut Henri Poincaré · 2016 · Science & Technology

Watch on YouTube

By Petr Kuznetsov (Télécom Paristech)
Abstract: The main complication in the analysis of distributed systems is the immense diversity of distributed computing models, combined with the lack of mathematical tools to handle this complexity. In this talk, we discuss how to characterize the computability power of a large class of models via properties of the corresponding simplicial complexes, combinatorial structures capturing representative sets of model executions.

More from this channel