We are very happy to present our first podcasts on distributed computing. Our guests give a brief glimpse on the work they are going to present at the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.
- Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge
- The Round Complexity of Distributed Sorting
- Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
- Coordinated Consensus in Dynamic Networks
- The Impact of Memory Models on Software Reliability in Multiprocessors
- Structuring Unreliable Radio Networks
- Optimal-Time Adaptive Strong Renaming with Applications to Counting
- Distributed Coloring in Few Rounds
- Conflict on a Communication Channel
- Byzantine Agreement with Homonyms
Download all interviews in one zip file (64MB)
