scientific article; zbMATH DE number 7561266

DOI10.4230/LIPICS.DISC.2018.14zbMath1497.68038MaRDI QIDQ5090904

Alexey Gotsman, Gregory Chockler

Publication date: 21 July 2022

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

zbMATH Keywords

Paxostwo-phase commitatomic commit problem

Mathematics Subject Classification ID

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

Cites Work

• Increasing the resilience of distributed and replicated database systems
• Complexity of distributed commit protocols
• A simple proof of the uniform consensus synchronous lower bound.
• The weakest failure detector for solving consensus
• Uniform consensus is harder than consensus
• The part-time parliament

This page was built for publication: