Computing in totally anonymous asynchronous shared memory systems
type: Item
instance of: scholarly article
title: Computing in totally anonymous asynchronous shared memory systems
zbMATH Open document ID: 1009.68012
author: Hagit Attiya
author: Alla Gorbach
author: Shlomo Moran
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 1853245
MaRDI profile type: Publication
OpenAlex ID: W1977549931
cites work: Computing on an anonymous ring
cites work: Q4942030
cites work: Bounds on shared memory for mutual exclusion
cites work: On the minimal synchronism needed for distributed consensus
cites work: On the space complexity of randomized synchronization
cites work: Impossibility of distributed consensus with one faulty process
cites work: The Wakeup Problem
cites work: Time and Space Lower Bounds for Nonblocking Implementations
cites work: The Byzantine Generals Problem
cites work: Closed schedulers: a novel technique for analyzing asynchronous protocols
cites work: A Lower Bound on Wait-Free Counting
cites work: Reaching Agreement in the Presence of Faults
cites work: Possibility and impossibility results in a shared memory environment
DOI: 10.1006/INCO.2001.3119
description: scientific article; zbMATH DE number 1853245