scientific article; zbMATH DE number 7561293

DOI10.4230/LIPIcs.DISC.2018.41MaRDI QIDQ5090934

No author found.

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1807.11557

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

consensuslattice agreementreplicated state machine

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15) Lattices (06B99)

Related Items (3)

Store-collect in the presence of continuous churn with application to snapshots and lattice agreement ⋮ On a scenario of transition to turbulence for polymer fluid flow in a circular pipe;Об одном сценарии перехода к турбулентности при течении полимерной жидкости в цилиндрическом канале ⋮ Asynchronous reconfiguration with Byzantine failures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Waiting in concurrent algorithms
• Generalized lattice agreement
• Authenticated Algorithms for Byzantine Agreement
• Concurrent Programming: Algorithms, Principles, and Foundations
• Impossibility of distributed consensus with one faulty process
• Atomic snapshots of shared memory
• Atomic Snapshots in O (n log n) Operations
• The part-time parliament
• Atomic snapshots using lattice agreement

This page was built for publication: