This talk will survey the tight connections between distributed computing and combinatorial topology. Indeed, combinatorial topology has been identified as a universal framework in which many different models for distributed computing can be expressed, and using combinatorial topology has been shown to be quite useful for analyzing the complexity of problems in these models. The talk will also present some recent results about the application of combinatorial topology in the framework of distributed network computing.
05/07/2019
11am, room G50, 3rd floor, building G (viale Regina Elena 295/B).
Pierre Fraigniaud got his PhD degree in Computer Science from ENS Lyon in 1990. He joined CNRS in 1991. He was director of the Institut de Recherche en Informatique Fondamentale (IRIF) located at Université de Paris. His main research interest is parallel and distributed computing, and specifically the design and analysis of distributed algorithms and data structures for networks. He is member of the Editorial Boards of Distributed Computing (DC), and Theory of Computing Systems (TOCS). He was Program Committee Chair of IPDPS 2017 (track Algorithms), ICALP 2014 (track Foundations of networked computation), PODC 2011, DISC 2005, SPAA 2001, and EuroPar 1996. In 2012, he received the Silver Medal from CNRS, and, in 2014, the Prize for Innovation in Distributed Computing.