Topology 2014 - Workshop on Distributed Computing Through Combinatorial Topology
Topics/Call fo Papers
Distributed Computing Through Combinatorial Topology
(20th Anniversary)
PODC 2014 Workshop
July 15, 2014 (afternoon)
Paris, France
Organizers:
Sergio Rajsbaum (sergio.rajsbaum-AT-gmail.com)
Dmitry Feichtner-Kozlov (dfkcat-AT-googlemail.com)
Maurice Herlihy (maurice.herlihy-AT-gmail.com)
Three papers presented in STOC 1993 announced the discovery of a deep connection between distributed computing and topology. Since then, dozens of papers have been published with exciting new techniques that have emerged for analyzing distributed algorithms. These techniques are based on notions adapted from topology, a field of mathematics concerned with properties of objects that are innate, in the sense of being preserved by continuous deformations such as stretching or twisting, although not by discontinuous operations such as tearing or gluing. Until very recently, a new student or researcher must assemble a collection of scattered conference publications, which are often terse, and often using different notations and terminologies. A book has recently been published with the aim of providing a self‐contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. This book, as well as 20 years of experience, provide a good opportunity to make a reunion and reflect on the past and future of this area, as well as to introduce newcomers to the area.
(20th Anniversary)
PODC 2014 Workshop
July 15, 2014 (afternoon)
Paris, France
Organizers:
Sergio Rajsbaum (sergio.rajsbaum-AT-gmail.com)
Dmitry Feichtner-Kozlov (dfkcat-AT-googlemail.com)
Maurice Herlihy (maurice.herlihy-AT-gmail.com)
Three papers presented in STOC 1993 announced the discovery of a deep connection between distributed computing and topology. Since then, dozens of papers have been published with exciting new techniques that have emerged for analyzing distributed algorithms. These techniques are based on notions adapted from topology, a field of mathematics concerned with properties of objects that are innate, in the sense of being preserved by continuous deformations such as stretching or twisting, although not by discontinuous operations such as tearing or gluing. Until very recently, a new student or researcher must assemble a collection of scattered conference publications, which are often terse, and often using different notations and terminologies. A book has recently been published with the aim of providing a self‐contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. This book, as well as 20 years of experience, provide a good opportunity to make a reunion and reflect on the past and future of this area, as well as to introduce newcomers to the area.
Other CFPs
- Workshop on Theoretical Aspects of Dynamic Distributed Systems TADDS 2014
- Workshop on Distributed Software-Defined Networks
- The Fifth Workshop on Realistic models for Algorithms in Wireless Networks (WRAWN)
- Workshop on Adaptive Resource Management and Scheduling for Cloud Computing
- Radboud Summer School on Neural Metrics
Last modified: 2014-03-21 07:18:22