scientific article; zbMATH DE number 7561259
From MaRDI portal
Publication:5090896
DOI10.4230/LIPIcs.DISC.2018.7zbMath1497.68033MaRDI QIDQ5090896
Dragos-Adrian Seredinschi, Karolos Antoniadis, Dahlia Malkhi, Rachid Guerraoui
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition of distributed programs into communication-closed layers
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Fast Paxos
- Paxos consensus, deconstructed and abstracted
- The Heard-Of model: computing in distributed systems with benign faults
- Agreement in synchronous networks with ubiquitous faults
- A Layered Analysis of Consensus
- Round-by-round fault detectors (extended abstract)
- On the complexity of asynchronous gossip
- Introduction to Reliable and Secure Distributed Programming
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- Impossibility of distributed consensus with one faulty process
- Time, clocks, and the ordering of events in a distributed system
- Unreliable failure detectors for reliable distributed systems
- The part-time parliament
- Multicoordinated Paxos
This page was built for publication:
