Lower bounds for asynchronous consensus
type: Item
instance of: scholarly article
title: Lower bounds for asynchronous consensus
zbMATH Open document ID: 1266.68119
author: Leslie Lamport
published in: Distributed Computing
publication date: 2013-06-20T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6177544
zbMATH Keywords: consensus
zbMATH Keywords: fault tolerance
zbMATH Keywords: distributed algorithms
zbMATH Keywords: paxos
MaRDI profile type: Publication
full work available at URL: s00446-006-0155-x
OpenAlex ID: W2002195182
cites work: Q4778617
cites work: Uniform consensus is harder than consensus
cites work: Revisiting the PAXOS algorithm
cites work: Impossibility of distributed consensus with one faulty process
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: How to Write a Proof
cites work: Q4413396
cites work: Q4934623
cites work: Fast Paxos
DOI: 10.1007/S00446-006-0155-X
description: scientific article; zbMATH DE number 6177544