Relationships between broadcast and shared memory in reliable anonymous distributed systems
type: Item
instance of: scholarly article
title: Relationships between broadcast and shared memory in reliable anonymous distributed systems
zbMATH Open document ID: 1264.68024
author: James Aspnes
author: Faith E. Fich
author: Eric Ruppert
published in: Distributed Computing
publication date: 2013-06-07T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6172100
zbMATH Keywords: anonymous
zbMATH Keywords: broadcast
zbMATH Keywords: shared memory
zbMATH Keywords: robustness
zbMATH Keywords: simulations
MaRDI profile type: Publication
full work available at URL: s00446-005-0145-4
OpenAlex ID: W2093197865
cites work: Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
cites work: Wait-free consensus with infinite arrivals
cites work: Computing in totally anonymous asynchronous shared memory systems
cites work: Q4398822
cites work: Computing anonymously with arbitrary knowledge
cites work: Q4436038
cites work: Q2766868
cites work: Polylog randomized wait-free consensus
cites work: Distributed Computing
cites work: Robust wait-free hierarchies
cites work: Solvability of Consensus: Composition Breaks Down for NonDeterministic Types
cites work: The Las-Vegas Processor Identity Problem (How and When to Be Unique)
cites work: The processor identity problem
cites work: Q4525687
cites work: Probabilistic parallel prefix computation
cites work: Comparison of initial conditions for distributed algorithms on anonymous networks
cites work: Q3661646
cites work: Space efficient processor identity protocol
DOI: 10.1007/S00446-005-0145-4
description: scientific article; zbMATH DE number 6172100