Distributed computing

InhaltsverzeichnisResilient Consensus for Infinitely Many Processes.Uniform Solvability with a Finite Number of MWMR Registers.Timing-Based Mutual Exclusion with Local Spinning.On the Uncontended Complexity of Consensus.Probabilistic Quorums for Dynamic Systems.Efficient Replication of Large Data Objects.On the Locality of Consistency Conditions.Multi-writer Consistency Conditions for Shared Memory Objects.Booting Clock Synchronization in Partially Synchronous Systems.Automatic Discovery of Mutual Exclusion Algorithms.On the Implementation Complexity of Specifications of Concurrent Programs.Competitive Management of Non-preemptive Queues with Multiple Values.Constructing Disjoint Paths for Secure Communication.Compact Routing for Flat Networks.Lower Bounds for Oblivious Single-Packet End-to-End Communication.Efficient Gossip and Robust Distributed Computation.Condition-Based Consensus in Synchronous Systems.Using Conditions to Expedite Consensus in Synchronous Distributed Systems.Tight Bounds on Early Local Decisions in Uniform Consensus.Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors.On Failure Detectors and Type Boosters.GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks.Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks.Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems.Overcoming the Majority Barrier in Large-Scale Systems.