Solvability in Asynchronous Environments II: Finite Interactive Tasks

DOI10.1137/S0097539795294979MaRDI QIDQ4268886zbMATH OpenOpenAlexFDO

Authors Benny Chor, Lee-Bath Nelson

Publication date 28 October 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539795294979

zbMATH Keywords

adversary schedulerasynchronous distributed systemsconsensusdecision tasksfault toleranceinteractive tasksrandomized algorithmssolvability

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• A combinatorial characterization of the distributed 1-solvable tasks
• Asynchronous computability theorems for \(t\)-resilient systems
• scientific article; zbMATH DE number 1559574
• Tight bounds on the round complexity of distributed 1-solvable tasks
• Randomized protocols for asynchronous consensus

Cited in

(4)

• scientific article; zbMATH DE number 139792 (Why is no real title available?)
• Hundreds of impossibility results for distributed computing
• Untangling partial agreement: iterated \(x\)-consensus simulations
• Tight bounds on the round complexity of distributed 1-solvable tasks

This page was built for publication: Solvability in Asynchronous Environments II: Finite Interactive Tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268886)