Distributed Computing and Combinatorial Topology
A number of researchers have successfully applied techniques from combinatorial
and algebraic topology to solve some long-standing open problems in distributed
computing. We will explain the basic concepts and techniques underlying
these results. This talk is intended for a general audience, and no prior
knowledge of topology is assumed.
This talk is adapted from the 2004 Goedel Prize lecture.
- Date:
- Speakers:
- Maurice Herlihy
-
-
Jeff Running
-