Algebraic Topologies and Distributed Computing
Sergio Rajsbaum received a degree in Computer Engineering from the National Autonomous University of Mexico (UNAM) in 1985, and a PhD in the Computer Science from the Technion, Israel, in 1991. Since then he has been a faculty member at the Institute of Mathematics at UNAM. His research interests are in the theory of distributed computing, especially issues related to coordination, complexity and computability. He has also worked in graph theory, algorithms, and content management systems. He has published over 100 papers and book on the use of topology for a distributed computing theoretical foundation, a topic on which he is one of the world leading experts.
The tutorial will give a self-contained introduction to the analysis of distributed algorithms using combinatorial topology techniques, covering the first few chapters of the book: Herlihy, Kozlov, Rajsbaum,Distributed Computing Through Combinatorial Topology (Elsevier-Morgan Kaufmann, 2013). Techniques to analyze when a given task can be solved in a given distributed computing model will be described. The effects of the parameters of the model, such as asynchrony, failures and different communication mechanisms will be explored.
March 17, 2017
Early Registration Deadline
Partners & Sponsors