The computational structure of progress conditions and shared objects
type: Item
instance of: scholarly article
title: The computational structure of progress conditions and shared objects
zbMATH Open document ID: 1434.68050
author: Gadi Taubenfeld
published in: Distributed Computing
publication date: 2020-04-23T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 7192807
zbMATH Keywords: progress conditions
zbMATH Keywords: shared objects
zbMATH Keywords: wait-freedom
zbMATH Keywords: \(k\)-obstruction-freedom
zbMATH Keywords: \(S\)-freedom
zbMATH Keywords: consensus
zbMATH Keywords: synchronization
zbMATH Keywords: wait-free hierarchy
zbMATH Keywords: power hierarchy
zbMATH Keywords: universality
MaRDI profile type: Publication
full work available at URL: s00446-019-00356-0
OpenAlex ID: W2949658900
cites work: Deterministic Objects
cites work: Distributed Computing
cites work: Timeliness-based wait-freedom
cites work: Safety-liveness exclusion in distributed computing
cites work: The disagreement power of an adversary
cites work: Hundreds of impossibility results for distributed computing
cites work: Impossibility of distributed consensus with one faulty process
cites work: Toward a theory of transactional contention managers
cites work: The weakest failure detectors to boost obstruction-freedom
cites work: The concurrency hierarchy, and algorithms for unbounded concurrency
cites work: Failure detectors as type boosters
cites work: The topology of distributed adversaries
cites work: On asymmetric progress conditions
cites work: Robust wait-free hierarchies
cites work: All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
cites work: Reaching Agreement in the Presence of Faults
cites work: Distributed universality
cites work: On the nonexistence of resilient consensus protocols
cites work: Contention-Sensitive Data Structures and Algorithms
cites work: Contention-sensitive data structures and algorithms
cites work: The Computational Structure of Progress Conditions
cites work: Coordination Without Prior Agreement
cites work: Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
Wikidata QID: Q127678358
DOI: 10.1007/S00446-019-00356-0
description: scientific article; zbMATH DE number 7192807