A Layered Analysis of Consensus
From MaRDI portal
Publication:2784490
DOI10.1137/S0097539799364006zbMath1015.68079MaRDI QIDQ2784490
Publication date: 23 April 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (26)
Synchronous condition-based consensus ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ Unnamed Item ⋮ Agreement in synchronous networks with ubiquitous faults ⋮ The topology of distributed adversaries ⋮ Power and limits of distributed computing shared memory models ⋮ Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Why Extension-Based Proofs Fail ⋮ No double discount: condition-based simultaneity yields limited gain ⋮ Layered reasoning for randomized distributed algorithms ⋮ Reaching consensus in the presence of contention-related crash failures ⋮ Message and time efficient consensus protocols for synchronous distributed systems ⋮ No Double Discount: Condition-Based Simultaneity Yields Limited Gain ⋮ Hundreds of impossibility results for distributed computing ⋮ Tight bounds for adopt-commit objects ⋮ Consensus in Networks of Multiagents with Stochastically Switching Topologies and Time-Varying Delays ⋮ Tracking analysis for general linearly coupled dynamical systems ⋮ Unnamed Item ⋮ An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems ⋮ Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults ⋮ Characterizing Consensus in the Heard-Of Model ⋮ A bivalency proof of the lower bound for uniform consensus ⋮ A simple proof of the uniform consensus synchronous lower bound. ⋮ A characterization of oblivious message adversaries for which consensus is solvable ⋮ A Characterization of Dynamic Networks Where Consensus Is Solvable
This page was built for publication: A Layered Analysis of Consensus
