Tight bounds for adopt-commit objects
type: Item
instance of: scholarly article
title: Tight bounds for adopt-commit objects
zbMATH Open document ID: 1314.68365
author: James Aspnes
author: Faith Ellen
published in: Theory of Computing Systems
publication date: 2015-01-19T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6387894
zbMATH Keywords: distributed computing
zbMATH Keywords: shared memory
zbMATH Keywords: anonymity
zbMATH Keywords: lower bounds
zbMATH Keywords: covering argument
zbMATH Keywords: adopt-commit
zbMATH Keywords: randomized consensus
MaRDI profile type: Publication
full work available at URL: s00224-013-9448-1
OpenAlex ID: W2005304136
cites work: Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
cites work: A modular approach to shared-memory consensus, with applications to the probabilistic-write model
cites work: Q4633853
cites work: Relationships between broadcast and shared memory in reliable anonymous distributed systems
cites work: Tight bounds for asynchronous randomized consensus
cites work: Lower Bounds for Randomized Consensus under a Weak Adversary
cites work: Efficient asynchronous consensus with the weak adversary scheduler
cites work: Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
cites work: Polylog randomized wait-free consensus
cites work: On the space complexity of randomized synchronization
cites work: Impossibility of distributed consensus with one faulty process
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: A short proof of Sperner's lemma
cites work: A layered analysis of consensus
cites work: The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
DOI: 10.1007/S00224-013-9448-1
description: scientific article; zbMATH DE number 6387894