Asynchronous computability theorems for \(t\)-resilient systems

DOI10.1007/978-3-662-53426-7_31zbMath1393.68033OpenAlexW2516358786MaRDI QIDQ1660951

Vikram Saraph, Eli Gafni, Maurice P. Herlihy

Publication date: 16 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-53426-7_31

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (3)

An algorithmic approach to the asynchronous computability theorem ⋮ Schlegel Diagram and Optimizable Immediate Snapshot Protocol ⋮ Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement

This page was built for publication: Asynchronous computability theorems for \(t\)-resilient systems