Distributed Computing and Combinatorial Topology

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=DdRpkWgGf40


Category:
Vlog
Duration: 1:05:07
417 views
11

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.



Other Videos By Microsoft Research


2016-09-07Accomplishing Successful Software Engineering Research in Universities
2016-09-07Microsoft Research Faculty Summit 2005 — Computing Research in India: A Sampling
2016-09-07An Extensible Semantics for XrML
2016-09-07Microsoft Research Faculty Summit 2005 — Robotics for Instruction
2016-09-07Microsoft Research Faculty Summit 2005 — Next-Generation User Interfaces and Media Platforms
2016-09-07Microsoft Research Faculty Summit 2005 — The Power of Freehand Interaction
2016-09-07Microsoft Research Faculty Summit 2005 — Classroom Presenter: Hands-on Lab
2016-09-07Privacy in Video Media Spaces
2016-09-07Mixin modules
2016-09-07Structural polymorphism in Generic Haskell
2016-09-07Distributed Computing and Combinatorial Topology
2016-09-07Synchronization Using Failure Detectors
2016-09-07Replicating Web Applications On-Demand
2016-09-07SHARK: Scaling File Servers via Cooperative Caching
2016-09-07Stochastic simulation of gene regulatory networks
2016-09-07The Scalable Hyperlink Store
2016-09-07Constraint satisfaction and constraint propagation
2016-09-07Locating Data Sources in Large Distributed Systems
2016-09-07Taming Survey Propagation
2016-09-07Ethernet Topology Discovery
2016-09-07The Z-Cast Project


Tags:
microsoft research