Possibility and impossibility results in a shared memory environment
type: Item
instance of: scholarly article
title: Possibility and impossibility results in a shared memory environment
zbMATH Open document ID: 0835.68037
author: Gadi Taubenfeld
author: Shlomo Moran
published in: Acta Informatica
publication date: 1995-11-19T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 814144
zbMATH Keywords: asynchronous protocols
zbMATH Keywords: impossibility
zbMATH Keywords: shared memory
zbMATH Keywords: atomic read and write operations
zbMATH Keywords: crash failures
zbMATH Keywords: winning strategy
MaRDI profile type: Publication
full work available at URL: s002360050034
OpenAlex ID: W2023880298
cites work: Q3753476
cites work: How processes learn
cites work: On the minimal synchronism needed for distributed consensus
cites work: Q3220545
cites work: Impossibility of distributed consensus with one faulty process
cites work: Leader election in the presence of n-1 initial failures
cites work: Impossibility results in the presence of multiple faulty processes
cites work: Initial failures in distributed computations
DOI: 10.1007/S002360050034
description: scientific article; zbMATH DE number 814144