Papers
Up one level- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Distributed algorithms for finding centers and medians in networks
- Reaching Agreement in the Presence of Faults
- Travelling through Wormholes
- Complexity of Network Synchronization
- Interval Tree Clocks
- Paxos Made Simple
- Failure Detection and Randomization
- Paper para apresentação dia 14 de Dezembro
- The Generic Consensus Service
- Paper para apresentação dia 14 de Dezembro
- A Leader Election Protocol for Fault Recovery in Asynchronous Fully-Connected Networks
- Paper para apresentação dia 14 de Dezembro
- The Mutable Consensus Protocol
- Paper para apresentação dia 14 de Dezembro
- Using Time Instead of Timeout for Fault-Tolerant Distributed Systems
- Consensus in the presence of partial synchrony
- Reaching approximate agreement in the presence of faults
- Optimal clock synchronization
- The Timed Asynchronous Distributed System Model